On the spectral radius, energy and Estrada index of the Sombor matrix of graphs

preprint2021arXivOpen access

Abstract

Let GG be a simple undirected graph with vertex set V(G)={v1,v2,…,vn}V(G)=\{v_1, v_2, \ldots, v_n\} and edge set E(G)E(G). The Sombor matrix S(G)\mathcal{S}(G) of a graph GG is defined so that its (i,j)(i,j)-entry is equal to di2+dj2\sqrt{d_i^2+d_j^2} if the vertices viv_i and vjv_j are adjacent, and zero otherwise, where did_i denotes the degree of vertex viv_i in GG. 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.