Relating energy and Sombor energy
Abstract: It is shown that for every bipartite graph G not containing cycles of size divisible by 4, the graph energy E(G) and the Sombor energy ESO(G) are related as √2 δ E(G) ≤ ESO(G) ≤ √2 Δ E(G), where δ and Δ are the minimum and maximum vertex degrees in G.
engleski
2021
© All rights reserved
Keywords: Sombor index, Sombor energy, energy (of graph), degree (of vertex).