𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Extremal Graphs with Bounded Girth

✍ Scribed by Charles Delorme; Evelyne Flandrin; Yuqing Lin; Mirka Miller; Joe Ryan

Book ID
108120730
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
173 KB
Volume
34
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Girth of -free extremal graphs
Girth of -free extremal graphs
✍ E. Abajo; C. Balbuena; A. DiΓ‘nez πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 267 KB
Extremal Regular Graphs with Prescribed
Extremal Regular Graphs with Prescribed Odd Girth
✍ G.H. Zhang πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 496 KB

The odd girth of a graph \(G\) gives the length of a shortest odd cycle in \(G\). Let \(f(k, g)\) denote the smallest \(n\) such that there exists a \(k\)-regular graph of order \(n\) and odd girth \(g\). It is known that \(f(k, g) \geqslant k g / 2\) and that \(f(k, g)=k g / 2\) if \(k\) is even. T

On the structure of extremal graphs of h
On the structure of extremal graphs of high girth
✍ Lazebnik, Felix; Wang, Ping πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 117 KB πŸ‘ 2 views

Let n β‰₯ 3 be a positive integer, and let G be a simple graph of order v containing no cycles of length smaller than n + 1 and having the greatest possible number of edges (an extremal graph). Does G contain an n + 1-cycle? In this paper we establish some properties of extremal graphs and present sev