Maximal energy of subdivisions of graphs with a fixed chromatic number
From MaRDI portal
(Redirected from Publication:745924)
Recommendations
Cites work
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- A new method of comparing the energies of subdivision bipartite graphs
- Eigenvalues of complete multipartite graphs
- Graphs and matrices with maximal energy
- Maximal energy bipartite graphs
- Maximal energy graphs
- On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph
- On the minimal energy of trees with a given diameter
- Polygonal chains with minimal energy
- The coefficients of Laplacian characteristic polynomials of graphs
- The energy of a graph
- The energy of graphs and matrices
This page was built for publication: Maximal energy of subdivisions of graphs with a fixed chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745924)