Three distance characteristic polynomials of some graphs
From MaRDI portal
Publication:2451677
Recommendations
- Three kinds of distance characteristic polynomials of five classes of special graphs
- A characterization of distance-regular graphs with diameter three
- Graphs with three distinct distance eigenvalues
- The characteristic polynomial of the complete 3-uniform hypergraph
- Three new distance-regular graphs
- scientific article; zbMATH DE number 165464
- On geometric distance-regular graphs with diameter three
- A characterization of Q-polynomial distance-regular graphs
- Characterization of some extremal graphs with diameter no greater than three
- On 3-chromatic distance-regular graphs
Cites work
- An introduction to the theory of graph spectra
- Enumeration of cospectral graphs.
- Generation of isospectral graphs
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- Isospectral graphs and isoperimetric constants
- Laplacian matrices of graphs: A survey
- Large families of cospectral graphs
- Large families of laplacian isospectral graphs
- On Isospectral Graphs.
- Spectra of graphs
- Spectra of graphs obtained by a generalization of the join graph operation
- Two Laplacians for the distance matrix of a graph
Cited in
(8)- Properties of the corolla polynomial of a 3-regular graph
- Enumeration of cospectral and coinvariant graphs
- Balancedness and spectra of signed graphs obtained by \(\dot{H}\)-join operation
- Cospectrality of graphs with respect to distance matrices
- Graphs that are cospectral for the distance Laplacian
- The generalized distance spectra of the \(\mathcal{M}\)-join of graphs
- Distance Laplacian spectra of graphs: a survey
- Distance signless Laplacian spectra of graphs: a survey
This page was built for publication: Three distance characteristic polynomials of some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2451677)