๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Four Constructions of Highly Symmetric Tetravalent Graphs

โœ Scribed by Aaron Hill; Steve Wilson

Book ID
115558793
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
668 KB
Volume
71
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Eigenvalue multiplicities of highly symm
Eigenvalue multiplicities of highly symmetric graphs
โœ Paul Terwilliger ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 905 KB

We find we prove: lower kunds on eigenvalue multiplicities for highly symmetric graphs. In partictiar ## I.. If r is distance-regular with valency k and girth g (g 2 4). and A (A # *k) IS an eigenvalue of r, then the multiplicity of h is at least k(& - #e/41-1 if g=O or 1 ,'mod 4), 2( k -1)["4' i

Constructing a Class of Symmetric Graphs
Constructing a Class of Symmetric Graphs
โœ Sanming Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 208 KB

We find a natural construction of a large class of symmetric graphs from point-and block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B, C of B, eithe