On graph energy, maximum degree and vertex cover number on graph energy, maximum degree and vertex cover number

DOI10.4418/2019.74.1.11MaRDI QIDQ5205526zbMATH OpenFDO

Authors Hilal A. Ganie, Uma Samee, Shariefuddin Pirzada

Publication date 12 December 2019

Full work available at URL https://doi.org/10.4418/2019.74.1.11

zbMATH Keywords

distance energyRandić energy

Mathematics Subject Classification ID

Vertex degrees (05C07) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Bounds for graph energy in terms of vertex covering and clique numbers
• Bounds of graph energy in terms of vertex cover number
• scientific article; zbMATH DE number 5005350
• Remarks on the bounds of graph energy in terms of vertex cover number or matching number.
• Upper bounds on the energy of graphs in terms of matching number

Cites work

• A lower bound for the energy of symmetric matrices and graphs
• Bounds of graph energy in terms of vertex cover number
• Graph energy
• scientific article; zbMATH DE number 1618184 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
• Note on the distance energy of graphs
• On distance energy of graphs
• On energy, Laplacian energy and \(p\)-fold graphs
• On Randić energy
• On Randić energy
• On the bounds for signless Laplacian energy of a graph
• On the Laplacian eigenvalues of a graph and Laplacian energy
• On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs
• On the sum of the Laplacian eigenvalues of a graph and Brouwer's conjecture
• Signless Laplacian energy of a graph and energy of a line graph
• Some new lower bounds for energy of graphs
• The energy of graphs and matrices

Cited in

(12)

• Energy of strong double graphs
• On unicyclic graphs with given number of pendent vertices and minimal energy
• On graphs with minimal distance signless Laplacian energy
• Energies of hypergraphs
• Remarks on the bounds of graph energy in terms of vertex cover number or matching number.
• Bounds for graph energy in terms of vertex covering and clique numbers
• Bounds of graph energy in terms of vertex cover number
• Lower bounds on the vertex cover number and energy of graphs
• Some Relations Between Rank, Vertex Cover Number and Energy of Graph
• Bounds for the -adjacency energy of a graph
• On spectral properties of neighbourhood second Zagreb matrix of graph
• Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy

This page was built for publication: On graph energy, maximum degree and vertex cover number on graph energy, maximum degree and vertex cover number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205526)