Loading...

A note on an inequality between energy and sombor index of a graph

Akbari, S ; Sharif University of Technology | 2023

275 Viewed
  1. Type of Document: Article
  2. DOI: 10.46793/match.90-3.765A
  3. Publisher: University of Kragujevac, Faculty of Science , 2023
  4. Abstract:
  5. The Sombor index of graph G is defined as Σuv∈E(G) √d2u + d2v, where du and dv are the degree of vertices u and v in G, respectively. The energy of G is defined as the sum of absolute values of all eigenvalues of its adjacency matrix and denoted by ε(G). It was proved that if G is a graph of order at least 3, then ε(G) < SO(G). In this paper, we strengthen this result by showing that if G is a connected graph of order n which is not Pn(n ≤ 8), then ε(G) ≤ SO(G)/2. © 2023 University of Kragujevac, Faculty of Science. All rights reserved
  6. Keywords:
  8. Source: Match ; Volume 90, Issue 3 , 2023 , Pages 765-771 ; 03406253 (ISSN)
  9. URL: https://match.pmf.kg.ac.rs/electronic_versions/Match90/n3/match90n3_765-771.pdf