The following pages link to (Q4189313):
Displaying 37 items.
- Hypercubes are determined by their distance spectra (Q290656) (← links)
- Geodesic growth of right-angled Coxeter groups based on trees (Q314039) (← links)
- The distance matrices of some graphs related to wheel graphs (Q364474) (← links)
- Two Laplacians for the distance matrix of a graph (Q389586) (← links)
- Constructing cospectral graphs (Q595685) (← links)
- On the spectral characterization of the union of complete multipartite graph and some isolated vertices (Q607028) (← links)
- Almost all trees are co-immanantal (Q751666) (← links)
- On the Laplacian coefficients of acyclic graphs (Q875026) (← links)
- Old and new results on algebraic connectivity of graphs (Q876302) (← links)
- Hermitian adjacency spectrum and switching equivalence of mixed graphs (Q891549) (← links)
- Towards a spectral theory of graphs based on the signless Laplacian. II. (Q962115) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- The bivariate Ising polynomial of a graph (Q967288) (← links)
- Distance matrix polynomials of trees (Q1247981) (← links)
- Laplacian graph eigenvectors (Q1307291) (← links)
- Factoring distance matrix polynomials (Q1313852) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- Which graphs are determined by their spectrum? (Q1414143) (← links)
- Reconstruction of weighted graphs by their spectrum (Q1580674) (← links)
- Zeta-equivalent digraphs: simultaneous cospectrality (Q2185854) (← links)
- Cospectral constructions for several graph matrices using cousin vertices (Q2236386) (← links)
- Distance spectra of graphs: a survey (Q2250935) (← links)
- On a conjecture of Graham and Lovász about distance matrices (Q2276978) (← links)
- Cospectrality of graphs with respect to distance matrices (Q2279251) (← links)
- Determining graphs by the complementary spectrum (Q2296010) (← links)
- Exponentially many graphs have a \(Q\)-cospectral mate (Q2359949) (← links)
- On the Wiener index, distance cospectrality and transmission-regular graphs (Q2399284) (← links)
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths (Q2401796) (← links)
- A construction of distance cospectral graphs (Q2408950) (← links)
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (Q2412994) (← links)
- A sufficient condition for a family of graphs being determined by their generalized spectra (Q2493103) (← links)
- Spectral properties of the exponential distance matrix (Q2692977) (← links)
- Domination and Spectral Graph Theory (Q3384115) (← links)
- On the Spectra of Reduced Distance Matrix of the Generalized Bethe Trees (Q4617713) (← links)
- Some properties of the distance Laplacian eigenvalues of a graph (Q5496694) (← links)
- Graphs sharing an arbitrary number of ordered complementarity eigenvalues (Q6136672) (← links)
- An explicit formula for the distance characteristic polynomial of threshold graphs (Q6159856) (← links)
