Energy, matching number and odd cycles of graphs

DOI10.1016/J.LAA.2019.04.029zbMath1416.05168OpenAlexW2942575433WikidataQ114152319 ScholiaQ114152319MaRDI QIDQ2002697

Firouzeh Ashraf

Publication date: 12 July 2019

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

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

zbMATH Keywords

matching numberodd cycleenergy of graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

A new method for the sum-edge characteristic polynomials of graphs ⋮ On the minimum energy of regular graphs ⋮ Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some relations between rank, chromatic number and energy of graphs
• On acyclic conjugated molecules with minimal energies
• Problems in algebraic combinatorics
• Lower bounds of graph energy in terms of matching number
• Relation between the skew energy of an oriented graph and its matching number
• Graph energy change due to edge deletion
• Graph Energy
• Skew-rank of an oriented graph in terms of matching number

This page was built for publication: Energy, matching number and odd cycles of graphs