✦ LIBER ✦

On complementary graphs with no isolated vertices

✍ Scribed by Renu Laskar; Bruce Auerbach

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 376 KB
Volume: 24
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90189-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Asymptotic Number of Labeled Graphs

The Asymptotic Number of Labeled Graphs withnVertices,qEdges, and No Isolated Vertices

✍ Edward A Bender; E Rodney Canfield; Brendan D McKay 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Let d(n, q) be the number of labeled graphs with n vertices, q N=( n 2 ) edges, and no isolated vertices. Let x=qÂn and k=2q&n. We determine functions w k t1, a(x), and .(x) such that d(n, q)tw k ( N q ) e n.(x)+a(x) uniformly for all n and q>nÂ2. 1997 Academic Press c(n, q)=u k \ N q + F(x) n A(x)

On the Spectral Radius of Graphs with Cu

On the Spectral Radius of Graphs with Cut Vertices

✍ Abraham Berman; Xiao-Dong Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Rao's conjecture on self-complementary g

Rao's conjecture on self-complementary graphs with K-factors

✍ Kiyoshi Ando 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract Rao posed the following conjecture, “Let G be a self‐complementary graph of order __p__, π = (d~1~ … dp) be its degree sequence. Then G has a k‐factor if and only if π − k, = (d1 − k, … dP − k) is graphical.” We construct a family of counterexamples for this conjecture for every k ⩾ 3.

On labeling the vertices of products of

On labeling the vertices of products of complete graphs with distance constraints

✍ D.J. Erwin; J.P. Georges; D.W. Mauro 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB

On graphs with at most four line-disjoin

On graphs with at most four line-disjoint paths connecting any two vertices

✍ John L Leonard 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 507 KB

On a random graph with immigrating verti

On a random graph with immigrating vertices: Emergence of the giant component

✍ David J. Aldous; Boris Pittel 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

A randomly evolving graph, with vertices immigrating at rate n and each possible edge appearing at rate 1/n, is studied. The detailed picture of emergence of giant components with O n 2/3 vertices is shown to be the same as in the Erdős-Rényi graph process with the number of vertices fixed at n at t