Lower bounds of graph energy in terms of matching number

DOI10.1016/j.laa.2018.03.040zbMath1390.05139OpenAlexW2792701075WikidataQ130077605 ScholiaQ130077605MaRDI QIDQ1747123

Xinlei Wang, Rui Chu, Dein Wong

Publication date: 3 May 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2018.03.040

zbMATH Keywords

rankmatching numbergraph energy

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) Structural characterization of families of graphs (05C75)

Related Items (11)

Upper bound of skew energy of an oriented graph in terms of its skew rank ⋮ Some Relations Between Rank, Vertex Cover Number and Energy of Graph ⋮ Some lower bounds for the energy of graphs in terms of spread of matrix ⋮ Relation between the trace norm of an oriented graph and its rank ⋮ A new method for the sum-edge characteristic polynomials of graphs ⋮ A lower bound for graph energy ⋮ Bounds for the energy of a complex unit gain graph ⋮ Energy, matching number and odd cycles of graphs ⋮ Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph ⋮ Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph ⋮ Remarks on the bounds of graph energy in terms of vertex cover number or matching number

Cites Work

• Unnamed Item
• A characterization of graphs with rank 4
• On graphs whose energy exceeds the number of vertices
• Lower bounds for the energy of digraphs
• Some relations between rank, chromatic number and energy of graphs
• Upper and lower bounds for the energy of bipartite graphs.
• Graph energy change due to edge deletion
• Graph Energy
• On the nullity of graphs

This page was built for publication: Lower bounds of graph energy in terms of matching number