## Abstract

For a simple graph G with vertex set { v_{1}, ⋯ , v_{n}} and degree sequence { d_{1}, ⋯ , d_{n}} , the Sombor matrix S(G) of G is an n× n matrix, whose (i, j) -th entry is di2+dj2 , if v_{i} and v_{j} are adjacent and 0, otherwise. The multi-set of the eigenvalues of S(G) is known as the Sombor spectrum of G, denoted by μ_{1}≥ μ_{2}≥ ⋯ ≥ μ_{n} , where μ_{1} is the Sombor spectral radius of G. The absolute sum of the Sombor eigenvalues is known as the trace norm (Sombor energy) of G. The spectral spread of S(G) is defined by s(S(G)) = μ_{1}- μ_{n} . In this article, we establish various sharp bounds for s(S(G)) in terms of various graph parameters like order, Schatten norm, Frobenius norm, trace norm, Forgotten topological index, Sombor index and many other invariants. We give complete characterization of the extremal graphs attaining these bounds. As a consequence of s(S(G)) , we present the bounds on the trace norm of S(G) along with the graphs attaining them.

Original language | English |
---|---|

Journal | Indian Journal of Pure and Applied Mathematics |

DOIs | |

Publication status | Accepted/In press - 2024 |

## Keywords

- Adjacency matrix
- Sombor index
- Sombor matrix
- spectral spread
- trace norm (energy)

## ASJC Scopus subject areas

- General Mathematics
- Applied Mathematics