๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Blocks and Cut Vertices of the Buneman Graph

โœ Scribed by Dress, A. W. M.; Huber, K. T.; Koolen, J.; Moulton, V.

Book ID
118197827
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
313 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Graph Theory with Algorithms and its App
Graph Theory with Algorithms and its Applications || Cut Sets and Cut Vertices
โœ Saha Ray, Santanu ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Springer India ๐ŸŒ Hindi โš– 254 KB

The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers

On graphs with cut vertices and cut edge
On graphs with cut vertices and cut edges
โœ Fang, Kun Fu; Shu, Jin Long ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› Institute of Mathematics, Chinese Academy of Scien ๐ŸŒ English โš– 188 KB
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