• No results found

Multipartite Graphs

Eigenvalues of the resistance distance matrix of complete multipartite graphs

Eigenvalues of the resistance distance matrix of complete multipartite graphs

... paper, we determine the eigenvalues of the resistance-distance matrix of complete multipartite graphs. Also, we give some lower and upper bounds on the largest eigenvalue of the resistance-distance matrix ...

11

The Matching Energy of Random Multipartite Graphs

The Matching Energy of Random Multipartite Graphs

... In this paper, we give some lower bounds for the matching energy of random bipartite graphs. And then we will use Chen et al’s method to generalize this conclusion to any random multipartite graphs, ...

5

Hamiltonian Cycle in Complete Multipartite Graphs

Hamiltonian Cycle in Complete Multipartite Graphs

... connected graphs and complete multipartite graphs has been an interesting type of problem from the elementary to the high order research in the study of ...complete multipartite graphs ...

6

EMBEDDING OF COMPLETE MULTIPARTITE GRAPHS INTO CYCLE-OF-LADDERS

EMBEDDING OF COMPLETE MULTIPARTITE GRAPHS INTO CYCLE-OF-LADDERS

... Abstract: Graph embedding is the mapping of a topological structure (guest graph) into another topological structure (host graph) that preserves certain required topological properties and the graph embedding ability ...

12

Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles

Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles

... Ramsey problems in graphs are generally about coloring the edges of a graph with as few colors as necessary so that no subgraph of a specified class is monochromatic. In this paper we look at a particular ...

10

Unsupervised Keyphrase Extraction with Multipartite Graphs

Unsupervised Keyphrase Extraction with Multipartite Graphs

... Another strand of work models documents as graphs of topics and selects keyphrases from the top-ranked ones (Bougouin et al., 2013). This higher level representation (see Figure 1a), in which topic relations are ...

6

$m_j(P_4,G)$ for all Graphs G on 4 Vertices

$m_j(P_4,G)$ for all Graphs G on 4 Vertices

... A.P.Burger and J.H.van Vuuren, Ramsey numbers in complete balanced multipartite graphs. V.Chavatal and F.Harary, Generalized Ramsey theory for graphs, III.[r] ...

8

The Linear kArboricity of Cartesian Product of Multipartite Balanced Complete Graphs

The Linear kArboricity of Cartesian Product of Multipartite Balanced Complete Graphs

... for graphs with particular ...regular graphs are ...planar graphs are obtained and the linear k− arboricity of cubic graphs are ob- ...complete multipartite graphs K n(m) , K n,n ...

6

Vol 9, No 1 (2018)

Vol 9, No 1 (2018)

... complete multipartite graphs and Lih [4] elaborately discussed about the equitable vertex coloring of graphs, in particular about bipartite graphs and trees in his ...

10

Theta Graph Designs

Theta Graph Designs

... We deal with each of the theta graphs stated in the theorems. The lemmas in this section assert the existence of specific graph designs and decompositions of multipartite graphs. These are used as ...

16

THE SIZE MULTIPARTITE RAMSEY NUMBERS $m_j(P_n,K_{j\times b})$

THE SIZE MULTIPARTITE RAMSEY NUMBERS $m_j(P_n,K_{j\times b})$

... balanced multipartite graphs, the numbers can be derived from result Burger and van Vuuren ...size multipartite Ramsey ...balanced, multipartite graphs, Syafrizal [5] showed lower bound ...

8

Upper domination and upper irredundance perfect graphs

Upper domination and upper irredundance perfect graphs

... perfect graphs form a subclass of absorbantly perfect graphs, and the inclusion is strict (see ...perfect graphs form a subclass of strongly Γ-perfect ...

11

Genuine multipartite nonlocality of permutationally invariant Gaussian states

Genuine multipartite nonlocality of permutationally invariant Gaussian states

... genuine multipartite nonlocality in pure permutationally in- variant Gaussian states of n bosonic modes, in terms of the largest amount by which the Svetlichny inequality [12] is vi- olated by specific ...genuine ...

10

Measuring multipartite entanglement via dynamic susceptibilities

Measuring multipartite entanglement via dynamic susceptibilities

... quantifying multipartite entanglement for large system size, while still being accessible with experimentally realistic tools and ...divergent multipartite entanglement by studying the universal scaling of ...

7

Trends in Fuzzy Graphs

Trends in Fuzzy Graphs

... intersection graphs to fuzzy intersection ...line graphs and developed its basic ...fuzzy graphs was investigated by Somasundaram ...fuzzy graphs were introduced by Atanassov (1999), and ...

5

Entanglement of multipartite quantum states and the generalized quantum search

Entanglement of multipartite quantum states and the generalized quantum search

... In chapter 3 Grover's unstructured quantum search algorithm is generalized to use an arbitrary starting superposition and an arbitrary unitary matrix.. A formulafm the probability of the[r] ...

85

A Size Multipartite Ramsey Problem Involving the Claw Graph

A Size Multipartite Ramsey Problem Involving the Claw Graph

... Syafrizal Sy and E.T.Baskoro, Lower bounds of the size multipartite Ramsey numbers, The 5 th Mathematics, AIP Conf.[r] ...

8

Multipartite Gaussian steering: monogamy constraints and quantum cryptography applications

Multipartite Gaussian steering: monogamy constraints and quantum cryptography applications

... of multipartite quantum correlations have been consid- ered as valuable resources for various applications in quan- tum communication ...tasks. Multipartite entanglement [2–8] and multipartite Bell ...

6

A Multipartite Mitochondrial Genome in the Potato Cyst Nematode Globodera pallida

A Multipartite Mitochondrial Genome in the Potato Cyst Nematode Globodera pallida

... The mitochondrial genome (mtDNA) of the plant parasitic nematode Globodera pallida exists as a popula- tion of small, circular DNAs that, taken individually, are of insufficient length to encode the typical meta- zoan ...

12

Size Multipartite Ramsey Numbers for Small Paths Versus Stripes

Size Multipartite Ramsey Numbers for Small Paths Versus Stripes

... red graphs (That is, there are no red graphs on G R [ p , p + 1] satisfying the required conditions, that could be obtained by adding red edges to any one of these graphs) are illustrated in the ...

10

Show all 3717 documents...

Related subjects