✦ LIBER ✦

The tree number of a graph with a given girth

✍ Scribed by M. Truszczyński

Publisher: Springer Netherlands
Year: 1988
Tongue: English
Weight: 796 KB
Volume: 19
Category: Article
ISSN: 0031-5303
DOI: 10.1007/bf01848836

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

A note on minimal directed graphs with g

A note on minimal directed graphs with given girth

✍ Yahya Ould Hamidoune 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 306 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

On universal graphs for planar oriented

On universal graphs for planar oriented graphs of a given girth

✍ O.V. Borodin; A.V. Kostochka; J. Nešetřil; A. Raspaud; E. Sopena 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 662 KB

The oriented chromatic number o(H) of an oriented graph H is defined to be the minimum order of an oriented graph H' such that H has a homomorphism to H'. If each graph in a class ~ has a homomorphism to the same H', then H' is ~-universal. Let ~k denote the class of orientations of planar graphs wi

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 ~.

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