✦ LIBER ✦

A Family of One-regular Graphs of Valency 4

✍ Scribed by Dragan Marusic

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 246 KB
Volume: 18
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1995.0076

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Valency of Distance-regular Antipodal Gr

Valency of Distance-regular Antipodal Graphs with Diameter 4

✍ Štefko Miklavič 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Let G be a non-bipartite strongly regular graph on n vertices of valency k. We prove that if G has a distance-regular antipodal cover of diameter 4, then k ≤ 2(n + 1)/5 , unless G is the complement of triangular graph T (7), the folded Johnson graph J (8, 4) or the folded halved 8-cube. However, for

Families of Regular Graphs in Regular Ma

Families of Regular Graphs in Regular Maps

✍ Steve Wilson 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 227 KB

The question of when a given graph can be the underlying graph of a regular map has roots a hundred years old and is currently the object of several threads of research. This paper outlines this topic briefly and proves that a product of graphs which have regular embeddings also has such an embeddin

A Note on A Family of Directed Strongly

A Note on A Family of Directed Strongly Regular Graphs

✍ Sylvia A. Hobart; T. Justin Shaw 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 54 KB

New families of strongly regular graphs

✍ Yury J. Ionin; Hadi Kharaghani 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract We apply symmetric balanced generalized weighing matrices with zero diagonal to construct four parametrically new infinite families of strongly regular graphs. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 208–217, 2003; Published online in Wiley InterScience (www.interscience.wil

Number of labeled 4-regular graphs

✍ R. C. Read; N. C. Wormald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB

## Abstract Several operations on 4‐regular graphs and pseudographs are analyzed and equations are obtained relating the numbers of these graphs on given numbers of labeled points. These equations are used recursively to find the numbers of 4‐regular graphs on up to 13 labeled points.

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