On the spectral radius, energy and Estrada index of the Sombor matrix of graphs
arXiv:2102.03960
Abstract
Let be a simple undirected graph with vertex set and edge set . The Sombor matrix of a graph is defined so that its -entry is equal to if the vertices and are adjacent, and zero otherwise, where denotes the degree of vertex in . In this paper, lower and upper bounds on the spectral radius, energy and Estrada index of the Sombor matrix of graphs are obtained, and the respective extremal graphs are characterized.
18