✦ LIBER ✦

On the number of vertices and edges of the Buneman graph

✍ Scribed by A. Dress; M. Hendy; K. Huber; V. Moulton

Book ID: 110555591
Publisher: Springer
Year: 1997
Tongue: English
Weight: 391 KB
Volume: 1
Category: Article
ISSN: 0218-0006
DOI: 10.1007/bf02558484

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Blocks and Cut Vertices of the Buneman G

Blocks and Cut Vertices of the Buneman Graph

✍ Dress, A. W. M.; Huber, K. T.; Koolen, J.; Moulton, V. 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 313 KB

On the effect of major vertices on the n

On the effect of major vertices on the number of light edges

✍ Sanders, Daniel P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 423 KB 👁 2 views

This paper presents an inequality satisfied by planar graphs of minimum degree five. For the purposes of this paper, an edge of a graph is light if the weight of the edge, or the sum of the degrees of the vertices incident with it, is at most eleven. The inequality presented shows that planar graph

On the number of unlabeled vertices in e

On the number of unlabeled vertices in edge-friendly labelings of graphs

✍ Elliot Krop; Sin-Min Lee; Christopher Raridan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Coverings and matchings of the vertices

Coverings and matchings of the vertices of a graph by the edges

✍ G.Ts. Akopyan 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 706 KB

Maximum number of edges joining vertices

Maximum number of edges joining vertices on a cube

✍ Khaled A.S. Abdel-Ghaffar 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 84 KB

Let E d (n) be the number of edges joining vertices from a set of n vertices on a d-dimensional cube, maximized over all such sets. We show that E d (n) = r-1 i=0 (l i /2 + i)2 l i , where r and l 0 > l 1 > • • • > l r-1 are nonnegative integers defined by n = r-1 i=0 2 l i .

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