Open AccessSpectral radius and energy of Sombor matrix of graphs
Author(s) -
Zhao Wang,
Yaping Mao,
Iván Gutman,
Jichang Wu,
Qin Ma
Publication year - 2021
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil2115093w
Subject(s) - spectral radius , mathematics , combinatorics , vertex (graph theory) , graph , radius , matrix (chemical analysis) , physics , chemistry , eigenvalues and eigenvectors , quantum mechanics , computer security , chromatography , computer science
Let G be a graph of order n. For i = 1,2,... , n, let di be the degree of the vertex vi of G. The Sombor matrix Aso of G is defined so that its (i, j)-entry is equal to ?d2i + d2j if the vertices vi and vj are adjacent, and 0 otherwise. The spectral radius ?1 and the energy Eso of Aso are examined. In particular, upper bounds on Eso are obtained, as well as Nordhaus-Gaddum-type results for ?1 and Eso.