𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Feasibility conditions for the existence of walk-regular graphs

✍ Scribed by C.D. Godsil; B.D. McKay

Book ID
107824831
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
712 KB
Volume
30
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new feasibility condition for distance
A new feasibility condition for distance-regular graphs
✍ Paul Terwilliger πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 228 KB

Let F be a distance-regular graph with valency k (k >I 2) and diameter at least 2, and denote by ;t 1 and 2%~m the second largest and least eigenvalue of F, respectively. Assume the multiplicity m( )O of some eigenvalue ;~ ( )~ :/: k) of F satisfies m( Z ) < k. Then ;~ = Z 1 or )'rot. and either (i)

A degree condition for the existence of
A degree condition for the existence of regular factors inK1,n-free graphs
✍ Ota, Katsuhiro; Tokuda, Taro πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 260 KB πŸ‘ 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.

The geometry of t-spreads in k-walk-regu
The geometry of t-spreads in k-walk-regular graphs
✍ C. DalfΓ³; M. A. Fiol; E. Garriga πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 117 KB πŸ‘ 1 views

## Abstract A graph is walk‐regular if the number of closed walks of length β„“ rooted at a given vertex is a constant through all the vertices for all β„“. For a walk‐regular graph __G__ with __d__+1 different eigenvalues and spectrally maximum diameter __D__=__d__, we study the geometry of its __d__‐