scientific article; zbMATH DE number 3627232
From MaRDI portal
Publication:4189313
Cited in
(51)- Distance matrix polynomials of trees
- Laplacian graph eigenvectors
- Factoring distance matrix polynomials
- Laplacian matrices of graphs: A survey
- Which graphs are determined by their spectrum?
- Reconstruction of weighted graphs by their spectrum
- Zeta-equivalent digraphs: simultaneous cospectrality
- Cospectral constructions for several graph matrices using cousin vertices
- Distance spectra of graphs: a survey
- On a conjecture of Graham and Lovász about distance matrices
- Cospectrality of graphs with respect to distance matrices
- Determining graphs by the complementary spectrum
- Exponentially many graphs have a \(Q\)-cospectral mate
- On the Wiener index, distance cospectrality and transmission-regular graphs
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- A construction of distance cospectral graphs
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
- A sufficient condition for a family of graphs being determined by their generalized spectra
- Spectral properties of the exponential distance matrix
- Hypercubes are determined by their distance spectra
- Geodesic growth of right-angled Coxeter groups based on trees
- Domination and spectral graph theory
- The distance matrices of some graphs related to wheel graphs
- Two Laplacians for the distance matrix of a graph
- Distance between distance spectra of graphs
- On the spectra of reduced distance matrix of the generalized Bethe trees
- The spectral characterizations of the connected multicone graphs K_w L H S and K_w L G Q(3, 9)
- \(\mathcal Q\)-cospectrality and \(\mathcal L\)-energy in cographs
- The laplacian matrix of a graph: unimodular congruence
- Some properties of the distance Laplacian eigenvalues of a graph.
- Graphs determined by their \(T\)-gain spectra
- Constructing cospectral graphs
- On the spectral characterization of the union of complete multipartite graph and some isolated vertices
- Graphs sharing an arbitrary number of ordered complementarity eigenvalues
- An explicit formula for the distance characteristic polynomial of threshold graphs
- Distance Laplacian spectra of graphs: a survey
- Spectra of variants of distance matrices of graphs and digraphs: a survey
- Distance signless Laplacian spectra of graphs: a survey
- Degree-similar graphs
- Coalescing sets preserving cospectrality of graphs arising from block similarity matrices
- Cospectral graphs obtained by edge deletion
- Computation of minimum d-hop connected dominating set of trees in O(n) time
- High-order spectral characterizations of graphs
- Degree-similar graphs and cospectral graphs
- Almost all trees are co-immanantal
- On the Laplacian coefficients of acyclic graphs
- Old and new results on algebraic connectivity of graphs
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189313)