Upper bounds of the energy of triangle-free graphs in terms of matching number
From MaRDI portal
Publication:5205762
DOI10.1080/03081087.2017.1408556zbMath1427.05140OpenAlexW2772660708MaRDI QIDQ5205762
Publication date: 16 December 2019
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2017.1408556
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
Related Items (3)
Unnamed Item ⋮ Upper bounds on the energy of graphs in terms of matching number ⋮ An extremal problem on Q-spectral radii of graphs with given size and matching number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- Bounds of graph energy in terms of vertex cover number
- Spectra of graphs
- On the tree with diameter 4 and maximal energy
- On the minimal energy of trees with a given diameter
- On graphs whose energy exceeds the number of vertices
- Some relations between rank, chromatic number and energy of graphs
- Upper and lower bounds for the energy of bipartite graphs.
- Relation between the skew energy of an oriented graph and its matching number
- Graph energy change due to edge deletion
- On minimal energies of trees of a prescribed diameter
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Graph Energy
- On the theory of the matching polynomial
- Maximal energy graphs
This page was built for publication: Upper bounds of the energy of triangle-free graphs in terms of matching number
