Bounds for incidence energy of some graphs
From MaRDI portal
Summary: Let \(G\) be a simple graph. The incidence energy (\(IE\) for short) of \(G\) is defined as the sum of the singular values of the incidence matrix. In this paper, a new upper bound for \(IE\) of graphs in terms of the maximum degree is given. Meanwhile, bounds for \(IE\) of the line graph of a semiregular graph and the paraline graph of a regular graph are obtained.
Recommendations
Cites work
- A survey of graph laplacians
- A survey on the Laplacian-energy-like invariant
- Clique-inserted-graphs and spectral dynamics of clique-inserting
- Graph energy
- Graph energy
- Graph theory with applications
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- scientific article; zbMATH DE number 3750956 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 5259335 (Why is no real title available?)
- Incidence energy of a graph
- Kirchhoff index in line, subdivision and total graphs of a regular graph
- Laplacian matrices of graphs: A survey
- Matrix Analysis
- Minimal energies of trees with given parameters
- More upper bounds for the incidence energy
- On incidence energy of a graph
- On incidence energy of graphs
- On Laplacian-energy-like invariant of a graph
- Signless Laplacians of finite graphs
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
- Some results on energy of unicyclic graphs with \(n\) vertices
- The asymptotic behavior of some indices of iterated line graphs of regular graphs
- The energy of graphs and matrices
- The spectrum of infinite regular line graphs
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Two distance-regular graphs
- Unicyclic graphs with given number of pendent vertices and minimal energy
- Upper and lower bounds for the energy of bipartite graphs.
Cited in
(13)- Upper bounds for some graph energies
- A sharp upper bound on the incidence energy of graphs in terms of connectivity
- Some improved bounds on two energy-like invariants of some derived graphs
- On incidence energy of graphs
- On -incidence energy and -distance energy of a graph.
- On incidence energy
- More upper bounds for the incidence energy
- Incidence energy of a graph
- scientific article; zbMATH DE number 6906806 (Why is no real title available?)
- On incidence energy of some graphs.
- Oriented incidence energy and threshold graphs
- Label incidence energy of partial edge labeled graph
- scientific article; zbMATH DE number 7731438 (Why is no real title available?)
This page was built for publication: Bounds for incidence energy of some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364520)