On bi-regular graphs determined by their generalized characteristic polynomials
From MaRDI portal
Publication:1940102
Recommendations
- On the construction of graphs determined by their generalized characteristic polynomials
- Generalized spectral characterizations of regular graphs based on graph-vectors
- Graphs determined by their generalized characteristic polynomials
- Graphs with at most one generalized cospectral mate
- The characteristic polynomial of a generalized join graph
Cites work
- A generalized characteristic polynomial of a graph having a semifree action
- A note on the spectral characterization of \(\theta \)-graphs
- Counting paths in graphs
- Developments on spectral characterizations of graphs
- Graphs determined by their generalized characteristic polynomials
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- Spectra of graphs
- Spectral characterizations of sun graphs and broken sun graphs
- The Sun graph is determined by its signless Laplacian spectrum
- Which graphs are determined by their spectrum?
- Which wheel graphs are determined by their Laplacian spectra?
Cited in
(6)- Generalized spectral characterizations of regular graphs based on graph-vectors
- Graphs determined by their generalized characteristic polynomials
- A solution to Gutman's problem on the characteristic polynomial of a bipartite graph
- On the construction of graphs determined by their generalized characteristic polynomials
- The characteristic polynomial of a generalized join graph
- scientific article; zbMATH DE number 4130430 (Why is no real title available?)
This page was built for publication: On bi-regular graphs determined by their generalized characteristic polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940102)