✦ LIBER ✦

Configurations, regular graphs and chemical compounds

✍ Scribed by Harald Gropp

Publisher: Springer
Year: 1992
Tongue: English
Weight: 494 KB
Volume: 11
Category: Article
ISSN: 0259-9791
DOI: 10.1007/bf01164199

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On tactical configurations, regular bipa

On tactical configurations, regular bipartite graphs, and (v, k, even)-designs

✍ Harald Gropp 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 795 KB

A report on small regular bipartite graphs is given. Some historical facts are mentioned as well as equivalent combinatorial structures are discussed. In the second part a new combinatorial structure, the (v,k, even/odd)-designs are introduced. Some first results on (v,k, even)-designs for even k ar

Configurations and graphs

✍ Harald Gropp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 509 KB

The main aim of this paper is not to present new results but to give a short survey on some relations between graphs and configurations. In the first part the analogy between configurations and regular bipartite graphs is described. Some instances of parallel research in graph theory and configurat

Configurations and graphs—II

✍ Harald Gropp 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 476 KB

The aim of this paper is to give a second survey on relations between graphs and configurations in the sense of [10]. It contains some further relations as well as additional remarks to topics which were mentioned in the first survey. In particular, a new and quite general connection concerning the

Regular Graphs, Eigenvalues and Regular

Regular Graphs, Eigenvalues and Regular Factors

✍ Hongliang Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB

## Abstract In this article, we obtain a sufficient condition for the existence of regular factors in a regular graph in terms of its third largest eigenvalue. We also determine all values of __k__ such that every __r__‐regular graph with the third largest eigenvalue at most has a __k__‐factor.

Distance regular graphs of diameter 3 an

Distance regular graphs of diameter 3 and strongly regular graphs

✍ A.E Brouwer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the

Regular factors of regular graphs

✍ B. Bollobás; Akira Saito; N. C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a