𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Girth of -free extremal graphs

✍ Scribed by E. Abajo; C. Balbuena; A. Diánez

Book ID
113564784
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
267 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Extremal Graphs with Bounded Girth
On Extremal Graphs with Bounded Girth
✍ Charles Delorme; Evelyne Flandrin; Yuqing Lin; Mirka Miller; Joe Ryan 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 173 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