✦ LIBER ✦

The asymptotic number of labeled graphs with given degree sequences

✍ Scribed by Edward A Bender; E.Rodney Canfield

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 470 KB
Volume: 24
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(78)90059-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of cutvertices in graphs with

The number of cutvertices in graphs with given minimum degree

✍ L.H. Clark; R.C. Entringer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 453 KB

The maximum number of cutvertices in a connected graph of order n having minimum degree at least 6 is determined for 6 > 5.

The number of labeled graphs placeable b

The number of labeled graphs placeable by a given permutation

✍ Hasunuma, Toru; Shibata, Yukio 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB 👁 2 views

Let S be a finite set and u a permutation on S. The permutation u\* on the set of 2-subsets of S is naturally induced by u. Suppose G is a graph and V(G), €(G) are the vertex set, the edge set, respectively. Let V(G) = S. If €(G) and u\*(€(G)), the image of €(G) by u\*, have no common element, then

(d,1)-total labeling of graphs with a gi

(d,1)-total labeling of graphs with a given maximum average degree

✍ Mickaël Montassier; André Raspaud 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 1 views

## Abstract The (__d__,1)‐total number $\lambda \_{d}^{T}(G)$ of a graph __G__ is the width of the smallest range of integers that suffices to label the vertices and the edges of __G__ so that no two adjacent vertices have the same color, no two incident edges have the same color, and the distance

On the number of vertices of given degre

On the number of vertices of given degree in a random graph

✍ Zbigniew Palka 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

The number of cut-vertices in a graph of

The number of cut-vertices in a graph of given minimum degree

✍ Michael O. Albertson; David M. Berman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in

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)