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

All minimum C5-saturated graphs

โœ Scribed by Ya-Chen Chen

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
234 KB
Volume
67
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimum C5-saturated graphs
Minimum C5-saturated graphs
โœ Ya-Chen Chen ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 208 KB

## Abstract A graph is __C__~5~โ€saturated if it has no fiveโ€cycle as a subgraph, but does contain a __C__~5~ after the addition of any new edge. We prove that the minimum number of edges in a __C__~5~ โ€saturated graph on __n__โ‰ฅ11 vertices is __sat__(__n, C__~5~)=โŒˆ10(__n__โˆ’1)/7โŒ‰โˆ’1 if __n__โˆˆ__N__~0~=

Cycle-saturated graphs of minimum size
Cycle-saturated graphs of minimum size
โœ C.A. Barefoot; L.H. Clark; R.C. Entringer; T.D. Porter; L.A. Szรฉkely; Zs. Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 707 KB

A graph G is called Ck-saturated if G contains no cycles of length k but does contain such a cycle after the addition of any new edge. Bounds are obtained for the minimum number of edges in Ck-saturated graphs for all k ~ 8 or 10 and n sufficiently large. In general, it is shown that the minimum is

Detour-saturated graphs
Detour-saturated graphs
โœ Lowell W. Beineke; J. E. Dunbar; M. Frick ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 160 KB

## Abstract A graph is said to be detourโ€saturated if the addition of any edge results in an increased greatest path length. In this paper, we add to the relatively small amount that is known about detourโ€saturated graphs. Our main result is a determination of all connected detourโ€saturated graphs