✦ LIBER ✦

Note on the girth of Ramanujan graphs

✍ Scribed by N.L Biggs; A.G Boshier

Book ID: 107884292
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 207 KB
Volume: 49
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90026-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the girth-doubling constructio

A note on the girth-doubling construction for polygonal graphs

✍ Ákos Seress; Eric Swartz 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 1 views

A near-polygonal graph is a graph which has a set C of m-cycles for some positive integer m such that each 2-path of is contained in exactly one cycle in C. If m is the girth of then the graph is called polygonal. Given a polygonal graph of valency r and girth m, Archdeacon and Perkel proved the exi

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

On the girth of infinite graphs

✍ Norbert Seifter 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Let X be an infinite k-valent graph with polynomial growth of degree d, i.e. there is an integer d and a constant c such that fx(n) 3, d> 1, 123, there exist k-valent connected graphs with polynomial growth of degree d and girth greater than 1. This means that in general the girth of graphs with pol

A Note on Group Choosability of Graphs w

A Note on Group Choosability of Graphs with Girth at least 4

✍ G. R. Omidi 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 110 KB

A note on minimum graphs with girth pair

A note on minimum graphs with girth pair (4, 2l + 1)

✍ Denis Hanson; Ping Wang; Gary Macgillivray 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

## Abstract We show that the size of a smallest connected __k__‐regular graph with girth pair (4, 2__l__ + 1) is within a constant of (2__l__ + 1) __k__/2. In so doing we disprove a conjecture of Harary and Kovacs.

On the -optimality in graphs with odd gi

On the -optimality in graphs with odd girth and even girth

✍ C. Balbuena; P. García-Vázquez; L.P. Montejano; J. Salas 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 222 KB

## a b s t r a c t For a connected graph G, the restricted edge-connectivity λ ′ (G) is defined as the minimum cardinality of an edge-cut over all edge-cuts S such that there are no isolated vertices in }, d(u) denoting the degree of a vertex u. The main result of this paper is that graphs with od