✦ LIBER ✦

Homogeneous Graphs and Regular Near Polygons

✍ Scribed by K. Nomura

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 210 KB
Volume: 60
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1006

No coin nor oath required. For personal study only.

✦ Synopsis

We consider a distance-regular graph having homogeneous edge patterns in each entry of its intersection diagram with respect to an edge. We call such graphs homogeneous graphs. We study elementary properties of homogeneous graphs, and we show these graphs are related deeply with regular near polygons. fi 1994 Academic Press, Inc.

📜 SIMILAR VOLUMES

Almost 2-homogeneous Bipartite Distance-

Almost 2-homogeneous Bipartite Distance-regular Graphs

✍ Brian Curtin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Strongly Closed Subgraphs in a Regular T

Strongly Closed Subgraphs in a Regular Thick Near Polygon

✍ Akira Hiraki 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 114 KB

In this paper we show that a regular thick near polygon has a tower of regular thick near subpolygons as strongly closed subgraphs if the diameter d is greater than the numerical girth g.

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.

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

EIGENVALUES OF THE LAPLACIAN ON REGULAR

EIGENVALUES OF THE LAPLACIAN ON REGULAR POLYGONS AND POLYGONS RESULTING FROM THEIR DISECTION

✍ L.M. Cureton; J.R. Kuttler 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 127 KB

The eigenvalue problem is considered for the Laplacian on regular polygons, with either Dirichlet or Neumann boundary conditions, which will be related to the unit circle by a conformal mapping. The polygonal problem is then equivalent to a weighted eigenvalue problem on the circle with the same bou

From regular boundary graphs to antipoda

From regular boundary graphs to antipodal distance-regular graphs

✍ Fiol, M. A.; Garriga, E.; Yebra, J. L. A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB 👁 2 views

Let Γ be a regular graph with n vertices, diameter D, and d + 1 In a previous paper, the authors showed that if P (λ) > n -1, then D ≤ d -1, where P is the polynomial of degree d-1 which takes alternating values ±1 at λ 1 , . . . , λ d . The graphs satisfying P (λ) = n -1, called boundary graphs, h