The Merris index of a graph.
Goldberg, Felix, Shapiro, Gregory (2003)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Displaying similar documents to “Strongly regular graphs: Values of and for which there are only finitely many feasible .”
The Merris index of a graph.
Approximating the isoperimetric number of strongly regular graphs.
Sivasubramanian, Sivaramakrishnan (2005)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Extension of strongly regular graphs.
Gera, Ralucca, Shen, Jian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The signless Laplacian separator of graphs.
You, Zhifu, Liu, Bolian (2011)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Graphs whose minimal rank is two: the finite fields case.
Barrett, Wayne, van der Holst, Hein, Loewy, Raphael (2005)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
On -extremal non-regular graphs.
Liu, Bolian, Huang, Yufei, You, Zhifu (2009)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Erratum to “A note on the largest eigenvalue of non-regular graphs”.
Liu, Bolian, Mu-Huo, Liu, You, Zhifu (2009)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
The strongly regular (40, 12, 2, 4) graphs.
Spence, E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs whose minimal rank is two.
Barrett, Wayne, van der Holst, Hein, Loewy, Raphael (2004)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
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...
Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
D. M. Cardoso, D. Cvetković (2006)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
A necessary and sufficient eigenvector condition for a connected graph to be bipartite.
Cioaba, Sebastian M. (2010)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
A quasi-spectral characterization of strongly distance-regular graphs.
Fiol, M.A. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A matrix representation of graphs and its spectrum as a graph invariant.
Emms, David, Hancock, Edwin R., Severini, Simone, Wilson, Richard C. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: