نتایج جستجو برای: complete graph

تعداد نتایج: 541414  

2008
Andrew J. Goodall Steven D. Noble

We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of counting the number of cocircuits of a graph is #P-complete.

Journal: :transactions on combinatorics 0
wai chee shiu hong kong baptist university

‎‎let $g=(v,e)$ be a simple graph‎. ‎an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$‎, ‎where $z_2={0,1}$ is the additive group of order 2‎. ‎for $iin{0,1}$‎, ‎let‎ ‎$e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$‎. ‎a labeling $f$ is called edge-friendly if‎ ‎$|e_f(1)-e_f(0)|le 1$‎. ‎$i_f(g)=v_f(...

Journal: :Journal of Graph Theory 2015
Daniel J. Harvey David R. Wood

In recent articles by Grohe and Marx, the treewidth of the line graph of a complete graph is a critical example—in a certain sense, every graph with large treewidth “contains” L(Kn). However, the treewidth of L(Kn) was not determined exactly. We determine the exact treewidth of the line graph of a complete graph. C © 2014 Wiley Periodicals, Inc. J. Graph Theory 00: 1–7,

Journal: :J. Comb. Theory, Ser. B 2013
Gwenaël Joret David R. Wood

Article history: Received 19 May 2011 Available online xxxx

2002
Yung-Ling Lai Feng-Hsu Chiang

It is known that determination problem of the bandwidth for an arbitrary graph is NP-complete. This paper establishes the bandwidth for the composition of a complete bipartite graph with other graphs; the strong product of a complete bipartite graph with a complete graph, a path, a cycle; and the tensor product of a complete graph with a complete graph.

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

1999
Catherine Greenhill

The problem of counting graph homomorphisms is considered. We show that the counting problem corresponding to a given graph is #P-complete unless every connected component of the graph is an isolated vertex without a loop, a complete graph with all loops present, or a complete unlooped bipartite graph.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید