English

Comparison of two techniques for proving nonexistence of strongly regular graphs

Combinatorics 2012-05-08 v1
Authors: Vasek Chvatal
View on arXiv ↗ PDF ↗

Abstract

We show that the method of counting closed walks in strongly regular graphs rules out no parameter sets other than those ruled out by the method of counting eigenvalue multiplicities.

Cite

@article{arxiv.0906.5389,
  title  = {Comparison of two techniques for proving nonexistence of strongly regular graphs},
  author = {Vasek Chvatal},
  journal= {arXiv preprint arXiv:0906.5389},
  year   = {2012}
}

Related papers

View all related →
Combinatorics · Mathematics
Strongly walk-regular graphs
Edwin R. van Dam, Gholamreza Omidi
2013-01-31
Combinatorics · Mathematics
Non-existence of (76,30,8,14) strongly regular graph
A. V. Bondarenko, A. Prymak, D. Radchenko
2017-04-20
Combinatorics · Mathematics
Circuits through prescribed edges
Paul Knappe, Max Pitz
2024-05-27
Social and Information Networks · Computer Science
Closed Walk Sampler: An Efficient Method for Estimating Eigenvalues of Large Graphs
Guyue Han, Harish Sethu
2018-05-22
Combinatorics · Mathematics
Algorithmic aspects of algebraic methods for graph isomorphism testing
Michal Kaukic
2007-05-23
Social and Information Networks · Computer Science
Subgraph centrality and walk-regularity
Eric Horton, Kyle Kloster, Blair D. Sullivan
2019-02-06
Probability · Mathematics
Remarks on the recurrence and transience of non-backtracking random walks
Paul Jung, Greg Markowsky
2019-05-21
Combinatorics · Mathematics
On regular graphs with four distinct eigenvalues
Xueyi Huang, Qiongxiang Huang
2016-11-16
Discrete Mathematics · Computer Science
On the Relativized Alon Eigenvalue Conjecture II: Asymptotic Expansion Theorems for Walks
Joel Friedman, David Kohler
2019-11-14
Combinatorics · Mathematics
Super-Walk Formulae for Even and Odd Laplacians in Finite Graphs
Chengzheng Yu
2017-07-13
Combinatorics · Mathematics
There is no (75,32,10,16) strongly regular graph
Jernej Azarija, Tilen Marc
2017-09-21
Combinatorics · Mathematics
Simple Graph Density Inequalities with no Sum of Squares Proofs
Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha R. Thomas
2018-12-24
Combinatorics · Mathematics
Directed strongly walk-regular graphs
Edwin R. van Dam, Gholamreza Omidi
2017-09-13
Statistical Mechanics · Physics
Restricted random walks on a graph
F. Y. Wu, H. Kunz
2007-05-23
Combinatorics · Mathematics
There is no strongly regular graph with parameters (460,153,32,60)
A. V. Bondarenko, A. Mellit, A. Prymak, D. Radchenko +1
2017-04-20
Data Structures and Algorithms · Computer Science
Planar Graphs: Random Walks and Bipartiteness Testing
Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler
2018-12-27
Machine Learning · Statistics
Delving Into Deep Walkers: A Convergence Analysis of Random-Walk-Based Vertex Embeddings
Dominik Kloepfer, Angelica I. Aviles-Rivero, Daniel Heydecker
2021-07-22
Combinatorics · Mathematics
An exact closed walks series formula for the complexity of regular graphs and some related bounds
Gregory P Constantine, Gregory Magda
2025-08-18
Combinatorics · Mathematics
On the non-existence of $srg(76,21,2,7)$
Monther R. Alfuraidan, Ibrahim O. Sarumi, Sergey Shpectorov
2017-06-23
Combinatorics · Mathematics
Support of Closed Walks and Second Eigenvalue Multiplicity of the Normalized Adjacency Matrix
Theo McKenzie, Peter M. R. Rasmussen, Nikhil Srivastava
2023-06-19
Discrete Mathematics · Computer Science
Gathering Information about a Graph by Counting Walks from a Single Vertex
Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky, Maksim Zhukovskii
2024-10-24
Combinatorics · Mathematics
There does not exist a strongly regular graph with parameters $(1911,270,105,27)$
Jack H. Koolen, Brhane Gebremichel
2021-09-10
Combinatorics · Mathematics
An infinite class of Neumaier graphs and non-existence results
Aida Abiad, Wouter Castryck, Maarten De Boeck, Jack H. Koolen +1
2021-09-30
Combinatorics · Mathematics
On the nonexistence of pseudo-generalized quadrangles
Ivan Guo, Jack H. Koolen, Greg Markowsky, Jongyook Park
2019-09-18
Quantum Physics · Physics
Comparing algorithms for graph isomorphism using discrete- and continuous-time quantum random walks
Kenneth Rudinger, John King Gamble, Eric Bach, Mark Friesen +2
2013-08-27
R2 v1 2026-06-21T13:19:12.077Z