✦ LIBER ✦

An unexpected result in coding the vertices of a graph

✍ Scribed by Melvin A Breuer; Jon Folkman

Publisher: Elsevier Science
Year: 1967
Tongue: English
Weight: 736 KB
Volume: 20
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(67)90082-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Unexpected Result in the Alkylation o

An Unexpected Result in the Alkylation of Thymine

✍ Patricia Grandjean; Rachida Benhaddou; Robert Granet; Pierre Krausz 📂 Article 📅 1997 🏛 Elsevier Science 🌐 French ⚖ 339 KB

A moderate yield(55%)preparation ofN-1substituted thyminehasbeenachievedbyreacting an excess of 4-bromobutylacetate at 100 "C for 48 brs. N-1, N-3 bisall@atedand O-alkylated compounds werealsoobtained as by-products. 0 1997Published byElsevierScienceLtd.

Estimation of the number of vertices of

Estimation of the number of vertices of different degrees in a graph

✍ Ove Frank 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 971 KB

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

On numbers of vertices of maximum degree

On numbers of vertices of maximum degree in the spanning trees of a graph

✍ Jerzy Topp; Preben D. Vestergaard 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 611 KB

For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it

The Number of Vertices of Degree k in a

The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph

✍ M.C. Cai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 346 KB