𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strongly walk-regular graphs

✍ Scribed by van Dam, E.R.; Omidi, G.R.

Book ID
119947167
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
160 KB
Volume
120
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Characterizing -walk-regular graphs
Characterizing -walk-regular graphs
✍ C. DalfΓ³; M.A. Fiol; E. Garriga πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 232 KB
Random strongly regular graphs?
Random strongly regular graphs?
✍ Peter J. Cameron πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 289 KB

Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36; 10; 4; 2), but there are 32548 non-isomorphic graphs with parameters (36; 15; 6; 6). (The ΓΏrst assertion is a special case of a theorem of Sh

Random strongly regular graphs?
Random strongly regular graphs?
✍ Peter J. Cameron πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 203 KB
Disconnecting strongly regular graphs
Disconnecting strongly regular graphs
✍ CioabΔƒ, Sebastian M.; Koolen, Jack; Li, Weiqiang πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 418 KB
Walk-regular divisible design graphs
Walk-regular divisible design graphs
✍ Dean CrnkoviΔ‡, Willem H. Haemers πŸ“‚ Article πŸ“… 2013 πŸ› Springer 🌐 English βš– 186 KB