Sombor index of clean graphs
Combinatorics
2025-06-10 v2
Abstract
Let be a graph with the vertex set and edge set . The Sombor index of , , is defined as , where is the degree of vertex in . The clean graph of a ring R, denoted by , is a graph with vertex set and two distinct vertices and are adjacent if and only if or ( and are the sets of idempotents and unit elements of R, respectively). The induced subgraph on is denoted by . In this paper, , for different values of the positive integer , is investigated.
Cite
@article{arxiv.2505.10090,
title = {Sombor index of clean graphs},
author = {M. Badie and R. Nikandish and M. Pirniia},
journal= {arXiv preprint arXiv:2505.10090},
year = {2025}
}