𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs with prescribed degree sets and girth

✍ Scribed by G. Chartrand; R. J. Gould; S. F. Kapoor

Publisher
Springer Netherlands
Year
1981
Tongue
English
Weight
319 KB
Volume
12
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs of Prescribed Girth and Bi-Degree
Graphs of Prescribed Girth and Bi-Degree
✍ Z. Furedi; F. Lazebnik; A. Seress; V.A. Ustimenko; A.J. Woldar πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 426 KB
The orders of graphs with prescribed deg
The orders of graphs with prescribed degree sets
✍ Timothy A. Sipka πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 321 KB πŸ‘ 1 views

## Abstract The degree set π’Ÿ^G^ of a graph __G__ is the set of degrees of the vertices of __G.__ For a finite nonempty set __S__ of positive integers, all positive integers __p__ are determined for which there exists a graph __G__ of order __p__ such that π’Ÿ^G^ = __S__.

Smallest regular graphs with prescribed
Smallest regular graphs with prescribed odd girth
✍ Guo-Hui Zhang πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 484 KB πŸ‘ 1 views

## Abstract 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.__ The exact values of __f(k,g)__ are determined if one of the following holds: __k__

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