𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Minimum Order of Extremal Graphs to have a Prescribed Girth

✍ Scribed by Balbuena, C.; García–Vázquez, P.

Book ID
115541091
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
141 KB
Volume
21
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 solution to an extremal problem on b
The solution to an extremal problem on balanced extensions of graphs
✍ A. Ruciński; A. Vince 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 694 KB

## Abstract For __n__ sufficiently large the order of a smallest balanced extension of a graph of order __n__ is, in the worst case, ⌊(__n__ + 3)^2^/8⌋. © 1993 John Wiley & Sons, Inc.