Maximal energy of subdivisions of graphs with a fixed chromatic number

DOI10.1007/S40840-014-0095-8zbMATH Open1322.05090OpenAlexW1987401949MaRDI QIDQ745924FDOQ745924

Authors: 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

Recommendations

• Maximal energy graphs
• Numerous graph energies of regular subdivision graph and complete graph
• scientific article; zbMATH DE number 1539552
• Some relations between rank, chromatic number and energy of graphs
• Choice number and energy of graphs

zbMATH Keywords

energychromatic numbersignless Laplacian matrixmultipartite graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Maximal energy graphs
• The energy of graphs and matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The energy of a graph
• Graphs and matrices with maximal energy
• Maximal energy bipartite graphs
• Polygonal chains with minimal energy
• On the minimal energy of trees with a given diameter
• Eigenvalues of complete multipartite graphs
• A new method of comparing the energies of subdivision bipartite graphs
• The coefficients of Laplacian characteristic polynomials of graphs
• On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph

Cited In (1)

• Numerous graph energies of regular subdivision graph and complete graph

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)