✦ LIBER ✦

Sparse sets in the complements of graphs with given girth

✍ Scribed by A.V. Kostochka; D.R. Woodall

Book ID: 108315538
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 145 KB
Volume: 233
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00235-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Size of Bipartite Graphs with a Give

The Size of Bipartite Graphs with a Given Girth

✍ Shlomo Hoory 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 90 KB

The tree number of a graph with a given

The tree number of a graph with a given girth

✍ M. Truszczyński 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 796 KB

The Laplacian spectral radius of bicycli

The Laplacian spectral radius of bicyclic graphs with a given girth

✍ Mingqing Zhai; Guanglong Yu; Jinlong Shu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 622 KB

Let B(n, g) be the class of bicyclic graphs on n vertices with girth g. Let B 1 (n, g) be the subclass of B(n, g) consisting of all bicyclic graphs with two edge-disjoint cycles and B 2 (n, g) = B(n, g) \ B 1 (n, g). This paper determines the unique graph with the maximal Laplacian spectral radius a

The maximum valency of regular graphs wi

The maximum valency of regular graphs with given order and odd girth

✍ Guo-Hui Zhang 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

## Abstract The odd girth of a graph __G__ is the length of a shortest odd cycle in __G__. Let __d__(__n, g__) denote the largest __k__ such that there exists a __k__‐regular graph of order __n__ and odd girth __g__. It is shown that __d____n, g__ ≥ 2|__n__/__g__≥ if __n__ ≥ 2__g__. As a consequenc

A lower bound on the order of regular gr

A lower bound on the order of regular graphs with given girth pair

✍ C. Balbuena; T. Jiang; Y. Lin; X. Marcote; M. Miller 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair was proved by Harary and Kovács [Regular graphs with given girth pair, J Graph Theory 7 (1983), 209–218]. A (δ, __g__)‐cage is a small

The number of cycle lengths in graphs of

The number of cycle lengths in graphs of given minimum degree and girth

✍ P. Erdős; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 333 KB

This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g. The most general result gives a lower bound of ck ~.