Diminished Sombor matrix, spectral radius, and energy of the graphs
arXiv:2508.06531
Abstract
Consider a simple graph with vertex set and edge set . The diminished Sombor matrix is constructed such that its entry is if vertices , and otherwise, where represents the degree of vertex . In this paper, we establish sharp bounds for the spectral radius, and energy of the Sombor matrix of graphs and identify the graphs that attain these extremal values.