Maximal energy of subdivisions of graphs with a fixed chromatic number

DOI10.1007/s40840-014-0095-8zbMath1322.05090OpenAlexW1987401949MaRDI QIDQ745924

Meiling Hu, Weigen Yan, Wei Qiu

Publication date: 15 October 2015

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-014-0095-8

zbMATH Keywords

energychromatic numbersignless Laplacian matrixmultipartite graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalues of complete multipartite graphs
• On the minimal energy of trees with a given diameter
• Graphs and matrices with maximal energy
• The energy of graphs and matrices
• On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph
• Maximal energy bipartite graphs
• Polygonal chains with minimal energy
• The energy of a graph
• The coefficients of Laplacian characteristic polynomials of graphs
• Maximal energy graphs

This page was built for publication: Maximal energy of subdivisions of graphs with a fixed chromatic number