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

Minimizing and maximizing the diameter in orientations of graphs

โœ Scribed by G. Gutin

Book ID
105677107
Publisher
Springer Japan
Year
1994
Tongue
English
Weight
256 KB
Volume
10
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Size in maximal triangle-free graphs and
Size in maximal triangle-free graphs and minimal graphs of diameter 2
โœ Curtiss Barefoot; Karen Casey; David Fisher; Kathryn Fraughnaugh; Frank Harary ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 290 KB

A triangle-free graph is maximal if the addition of any edge creates a triangle. For n ~> 5, we show there is an n-node m-edge maximal triangle-free graph if and only if it is complete bipartite or 2n-5<<.m<<.L(n-1)2/4J+l. A diameter 2 graph is minimal if the deletion of any edge increases the diame

Maximal and Minimal Vertex-Critical Grap
Maximal and Minimal Vertex-Critical Graphs of Diameter Two
โœ Jing Huang; Anders Yeo ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 446 KB

A graph is vertex-critical if deleting any vertex increases its diameter. We construct, for each & 5 except &=6, a vertex-critical graph of diameter two on & vertices with at least , where c 2 is some constant. We also construct, for each & 5 except &=6, a vertex-critical graph of diameter two on &