scientific article; zbMATH DE number 3627232
From MaRDI portal
Publication:4189313
zbMath0404.05045MaRDI QIDQ4189313
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (42)
Exponentially many graphs have a \(Q\)-cospectral mate ⋮ Hypercubes are determined by their distance spectra ⋮ Geodesic growth of right-angled Coxeter groups based on trees ⋮ On the Wiener index, distance cospectrality and transmission-regular graphs ⋮ Constructing cospectral graphs ⋮ Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths ⋮ The distance matrices of some graphs related to wheel graphs ⋮ On the Laplacian coefficients of acyclic graphs ⋮ Old and new results on algebraic connectivity of graphs ⋮ A construction of distance cospectral graphs ⋮ On the spectral characterization of the union of complete multipartite graph and some isolated vertices ⋮ Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves ⋮ Two Laplacians for the distance matrix of a graph ⋮ Zeta-equivalent digraphs: simultaneous cospectrality ⋮ Hermitian adjacency spectrum and switching equivalence of mixed graphs ⋮ Graphs sharing an arbitrary number of ordered complementarity eigenvalues ⋮ An explicit formula for the distance characteristic polynomial of threshold graphs ⋮ Distance between distance spectra of graphs ⋮ Spectral properties of the exponential distance matrix ⋮ Which graphs are determined by their spectrum? ⋮ The spectral characterizations of the connected multicone graphs Kw ▽ LHS and Kw ▽ LGQ(3,9) ⋮ Cospectral constructions for several graph matrices using cousin vertices ⋮ -cospectrality and -energy in cographs ⋮ Distance spectra of graphs: a survey ⋮ Towards a spectral theory of graphs based on the signless Laplacian. II. ⋮ A survey of automated conjectures in spectral graph theory ⋮ The bivariate Ising polynomial of a graph ⋮ A sufficient condition for a family of graphs being determined by their generalized spectra ⋮ On a conjecture of Graham and Lovász about distance matrices ⋮ Cospectrality of graphs with respect to distance matrices ⋮ Distance matrix polynomials of trees ⋮ On the Spectra of Reduced Distance Matrix of the Generalized Bethe Trees ⋮ Determining graphs by the complementary spectrum ⋮ Domination and Spectral Graph Theory ⋮ The laplacian matrix of a graph: unimodular congruence ⋮ Almost all trees are co-immanantal ⋮ Some properties of the distance Laplacian eigenvalues of a graph ⋮ Reconstruction of weighted graphs by their spectrum ⋮ GRAPHS DETERMINED BY THEIR -GAIN SPECTRA ⋮ Laplacian graph eigenvectors ⋮ Factoring distance matrix polynomials ⋮ Laplacian matrices of graphs: A survey
This page was built for publication:
