Developments on spectral characterizations of graphs

DOI10.1016/J.DISC.2008.08.019zbMath1205.05156OpenAlexW2106508535MaRDI QIDQ1011495

Willem H. Haemers, van Dam, Edwin R.

Publication date: 8 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://research.tilburguniversity.edu/en/publications/7b5eb8d4-dfc2-4392-bb3f-491efeb35c6d

zbMATH Keywords

distance-regular graphscospectral graphsspectra of graphsgeneralized adjacency matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (only showing first 100 items - show all)

The spectral determinations of some classes of multicone graphs ⋮ $Kite_{p+2,p}$ is determined by its Laplacian spectrum ⋮ On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices ⋮ Spectral characterization of multicone graphs ⋮ Laplacian spectral characterization of dumbbell graphs and theta graphs ⋮ Laplacian spectral characterization of clover graphs ⋮ Unnamed Item ⋮ On the spectral characterization of Kite graphs ⋮ Signless Laplacian spectral characterization of line graphs ofT-shape trees ⋮ Enumeration of cubic Cayley graphs on dihedral groups ⋮ On the eigenvalues of eccentricity matrix of graphs ⋮ On the least distance eigenvalue and its applications on the distance spread ⋮ On the signless Laplacian spectral characterization of the line graphs of T-shape trees ⋮ Per-spectral characterizations of some bipartite graphs ⋮ Laplacian spectral characterization of roses ⋮ Signless Laplacian determinations of some graphs with independent edges ⋮ Spectral determinations and eccentricity matrix of graphs ⋮ Signless Laplacian spectral characterization of 4-rose graphs ⋮ Spectrum Consistent Coarsening Approximates Edge Weights ⋮ Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\) ⋮ Some graphs determined by their \(A_\alpha\)-spectra ⋮ Generalized spectral characterization of rooted product graphs ⋮ Generalized spectral characterizations of regular graphs based on graph-vectors ⋮ Generalized spectral characterizations of a new family of noncontrollable graphs ⋮ Smith normal form and the generalized spectral characterization of oriented graphs ⋮ Finding singularly cospectral graphs ⋮ A note on the spectral characterization of strongly connected bicyclic digraphs ⋮ The line graphs of lollipop graphs are determined by their spectra ⋮ On the divisibility of H-shape trees and their spectral determination ⋮ Spectral theory of the non-backtracking Laplacian for graphs ⋮ Differentiate data by higher-order structures ⋮ Graphs with at most one generalized cospectral mate ⋮ Laplacian spectral characterization of 3-rose graphs ⋮ Complete multipartite graphs are determined by their distance spectra ⋮ On the second largest distance eigenvalue of a graph ⋮ THE SPECTRAL DETERMINATIONS OF THE JOIN OF TWO FRIENDSHIP GRAPHS ⋮ On the multiplicity of distance signless Laplacian eigenvalues of graphs ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ The spectral characterizations of the connected multicone graphs Kw ▽ LHS and Kw ▽ LGQ(3,9) ⋮ Laplacian spectral characterization of disjoint union of paths and cycles ⋮ On the spectral determinations of the connected multicone graphs ⋮ The spectral characterization of the connected multicone graphs ⋮ On the spectral characterization of Π-shape trees ⋮ The spectral determination of the connected multicone graphs ⋮ On the symmetric doubly stochastic matrices that are determined by their spectra and their connection with spectral graph theory ⋮ Constructing isospectral non‐isomorphic digraphs from hypergraphs ⋮ Domination and Spectral Graph Theory ⋮ Unnamed Item ⋮ Connected signed graphs L-cospectral to signed ∞-graphs ⋮ Spectral characterization of line graphs of starlike trees ⋮ GRAPHS DETERMINED BY THEIR -GAIN SPECTRA ⋮ On the restricted numerical range of the Laplacian matrix for digraphs ⋮ On the D_α-spectra of graphs ⋮ A general method to obtain the spectrum and local spectra of a graph from its regular partitions ⋮ Signless Laplacian spectral characterization of some disjoint union of graphs ⋮ The spectral determinations of connected multicone graphs \(K_{\mathcal{W}} \operatorname{\nabla} mCP(n)\) ⋮ Graphs determined by their \(A_\alpha\)-spectra ⋮ Hypercubes are determined by their distance spectra ⋮ A special class of triple starlike trees characterized by Laplacian spectrum ⋮ Eigenvalues of Cayley graphs ⋮ Laplacian spectral characterization of some graph join ⋮ The spectral characterization of wind-wheel graphs ⋮ On the generalized \(A_\alpha\)-spectral characterizations of almost \(\alpha\)-controllable graphs ⋮ On the construction of cospectral nonisomorphic bipartite graphs ⋮ Spectral characterizations of tournaments ⋮ The signless Laplacian spectral radius of \(k\)-connected irregular graphs ⋮ On Hosoya's dormants and sprouts ⋮ A simple arithmetic criterion for graphs being determined by their generalized spectra ⋮ A new criterion for almost controllable graphs being determined by their generalized spectra ⋮ Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths ⋮ Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra ⋮ Spectral properties of the eccentricity matrix of graphs ⋮ Spectral characterization of some cubic graphs ⋮ On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs ⋮ Note on the spectral characterization of some cubic graphs with maximum number of triangles ⋮ Generalized spectral characterization of graphs revisited ⋮ Ihara zeta functions and cospectrality of joins of regular graphs ⋮ Hermitian adjacency spectrum and switching equivalence of mixed graphs ⋮ Spectral characterizations of almost complete graphs ⋮ Cospectral mates for the union of some classes in the Johnson association scheme ⋮ On the spectral characterization of some unicyclic graphs ⋮ On the signless Laplacian spectral radius of irregular graphs ⋮ Graphs determined by their generalized characteristic polynomials ⋮ On bi-regular graphs determined by their generalized characteristic polynomials ⋮ Laplacian spectral characterization of some graphs obtained by product operation ⋮ Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\) ⋮ On a theorem of Godsil and McKay concerning the construction of cospectral graphs ⋮ On NP-hard graph properties characterized by the spectrum ⋮ On graphs whose orientations are determined by their Hermitian spectra ⋮ The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\) ⋮ The graph with spectrum \(14^{1} 2^{40}( - 4)^{10}( - 6)^{9}\) ⋮ The spectral characterization of \(\infty\)-graphs ⋮ Laplacian spectral characterization of some graph products ⋮ Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum ⋮ An odd characterization of the generalized odd graphs ⋮ Laplacian spectral characterization of (broken) dandelion graphs ⋮ Generalized spectral characterization of mixed graphs ⋮ New families of graphs determined by their generalized spectrum ⋮ Spectral characterization of the complete graph removing a path of small length ⋮ \( A_\alpha\)-spectral characterizations of some joins

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing cospectral graphs
• Combinatorial designs with two singular values. I: Uniform multiplicative designs
• An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
• Characterizing distance-regularity of graphs by the spectrum
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
• Starlike trees are determined by their Laplacian spectrum
• Cospectral graphs and the generalized adjacency matrix
• Signless Laplacians of finite graphs
• Spectral characterizations of lollipop graphs
• The multi-fan graphs are determined by their Laplacian spectra
• Spectral characterization of the Hamming graphs
• The lollipop graph is determined by its spectrum
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• A note on cospectral graphs
• Feasibility conditions for the existence of walk-regular graphs
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Strongly regular graphs with smallest eigenvalue -m
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Combinatorial designs with two singular values. II: Partial geometric designs
• Some results on graph spectra
• Some results on starlike and sunlike graphs
• Laplacian spectra and spanning trees of threshold graphs
• On the spectral characterization of T-shape trees
• On the generalized spectral characterization of graphs having an isolated vertex
• Research problems from the Aveiro workshop on graph spectra
• Classification of some strongly regular subgraphs of the McLaughlin graph
• The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
• On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
• A sufficient condition for a family of graphs being determined by their generalized spectra
• Regularity and the generalized adjacency spectra of graphs
• A new family of distance-regular graphs with unbounded diameter
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS
• On the embedding of graphs into graphs with few eigenvalues
• Random strongly regular graphs?
• The search for pseudo orthogonal Latin squares of order six
• No starlike trees are cospectral

This page was built for publication: Developments on spectral characterizations of graphs