✦ LIBER ✦

New families of strongly regular graphs

✍ Scribed by Yury J. Ionin; Hadi Kharaghani

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 116 KB
Volume: 11
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.10038

No coin nor oath required. For personal study only.

✦ Synopsis

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.wiley.com). DOI 10.1002/jcd.10038

📜 SIMILAR VOLUMES

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

Deza graphs: A generalization of strongl

Deza graphs: A generalization of strongly regular graph

✍ M. Erickson; S. Fernando; W. H. Haemers; D. Hardy; J. Hemmeter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

On strongly regular self - complementary

On strongly regular self - complementary graphs

✍ Sergio Ruiz 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 1 views

## Abstract It is shown that certain conditions assumed on a regular self‐complementary graph are not sufficient for the graph to be strongly regular, answering in the negative a question posed by Kotzig in [1].

Embedding arbitrary finite simple graphs

Embedding arbitrary finite simple graphs into small strongly regular graphs

✍ Jajcay, Robert; Mesner, Dale 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB 👁 1 views

It is well known that any finite simple graph Γ is an induced subgraph of some exponentially larger strongly regular graph Γ (e.g., [2,8]). No general polynomial-size construction has been known. For a given finite simple graph Γ on v vertices, we present a construction of a strongly regular graph Γ

Strongly Regular Square-free Graphs with

Strongly Regular Square-free Graphs with μ=2

✍ Benjamin V.C. Collins 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 277 KB

By a square in an undirected graph ⌫ , we mean a cycle x , y , z , w such that x is not adjacent to z and y is not adjacent to w . Suppose that ⌫ is a strongly regular graph with ϭ 2 , and assume that ⌫ does not contain a square . Pick any vertex x of ⌫ and let ⌫ Ј denote the induced subgraph on the