✦ LIBER ✦

Deza graphs: A generalization of strongly regular graph

✍ Scribed by M. Erickson; S. Fernando; W. H. Haemers; D. Hardy; J. Hemmeter

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 139 KB
Volume: 7
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(1999)7:6<395::aid-jcd1>3.0.co;2-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 Γ

Fast generation of regular graphs and co

Fast generation of regular graphs and construction of cages

✍ Meringer, Markus 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 1 views

The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. In this article an efficient algorithm to generate regular graphs with a given number of vertices and vertex degree is introduced. The method is based on orderly genera

P4-decompositions of regular graphs

✍ Heinrich, Katherine; Liu, Jiping; Yu, Minli 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

In this article, we show that every simple r-regular graph G admits a balanced P 4 -decomposition if r ≡ 0(mod 3) and G has no cut-edge when r is odd. We also show that a connected 4-regular graph G admits a P 4 -decomposition if and only if |E(G)| ≡ 0(mod 3) by characterizing graphs of maximum degr

1-Factorizations of random regular graph

1-Factorizations of random regular graphs

✍ M. S. O. Molloy; H. Robalewska; R. W. Robinson; N. C. Wormald 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 2 views

It is shown that for each r G 3, a random r-regular graph on 2 n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2 n vertices, as n ª ϱ. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almo

Generation of isospectral graphs

✍ Halbeisen, Lorenz; Hungerb�hler, Norbert 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB

We discuss a discrete version of Sunada's Theorem on isospectral manifolds, which allows the generation of isospectral simple graphs, i.e., nonisomorphic simple graphs that have the same Laplace spectrum. We also consider additional boundary conditions and Buser's transplantation technique applied t

r-Regular, r-connected decompositions of

r-Regular, r-connected decompositions of complete graphs

✍ H. Fleischner; W. R. Johnstone; A. J. W. Hilton 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

If rjn À 1 and rn is even, then K n can be expressed as the union of t nÀ1 r edgedisjoint isomorphic r-regular r-connected factors.