Characerization of a class of distance regular graphs.

A. Neumaier

Displaying similar documents to “Characerization of a class of distance regular graphs.”

Inequivalent Regular Factors of Regular Graphs on 8 Vertices

Zoran S. Radosavljević (1981)

Publications de l'Institut Mathématique

Similarity:

Operations on directed graphs.

Jürgen Eufinger (1971)

Journal für die reine und angewandte Mathematik

Similarity:

On the structure of 5- and 6-chromatic abstract graphs.

G.A. Dirac (1964)

Journal für die reine und angewandte Mathematik

Similarity:

Minimal regular graphs with given girths and crossing numbers

G.L. Chia, C.S. Gan (2004)

Discussiones Mathematicae Graph Theory

Similarity:

This paper investigates on those smallest regular graphs with given girths and having small crossing numbers.

Construction of Cospectral Integral Regular Graphs

Ravindra B. Bapat, Masoud Karimi (2017)

Discussiones Mathematicae Graph Theory

Similarity:

Graphs G and H are called cospectral if they have the same characteristic polynomial. If eigenvalues are integral, then corresponding graphs are called integral graph. In this article we introduce a construction to produce pairs of cospectral integral regular graphs. Generalizing the construction of G4(a, b) and G5(a, b) due to Wang and Sun, we define graphs 𝒢4(G,H) and 𝒢5(G,H) and show that they are cospectral integral regular when G is an integral q-regular graph of order m and H...

Minimally n-line connected graphs.

Don R. Lick (1972)

Journal für die reine und angewandte Mathematik

Similarity:

A classification of tetravalent one-regular graphs of order 3p²

Mohsen Ghasemi (2012)

Colloquium Mathematicae

Similarity:

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper, tetravalent one-regular graphs of order 3p², where p is a prime, are classified.