English

Sombor index of clean graphs

Combinatorics 2025-06-10 v2

Abstract

Let G=(V,E)G = (V, E) be a graph with the vertex set V(G)V (G) and edge set E(G)E(G). The Sombor index of GG, SO(G)SO(G), is defined as uvE(G)deg(u)2+deg(v)2\sum_{uv\in E(G)} \sqrt{deg(u)^2 + deg(v)^2}, where deg(u)deg(u) is the degree of vertex uu in V(G)V (G). The clean graph of a ring R, denoted by Cl(R)Cl(R), is a graph with vertex set {(e,u):eId(R),uU(R)}\{(e, u) : e \in Id(R), u \in U(R)\} and two distinct vertices (e,u)(e, u) and(f,v)(f, v) are adjacent if and only if ef=0ef = 0 or uv=1uv = 1 (Id(R)Id(R) and U(R)U(R) are the sets of idempotents and unit elements of R, respectively). The induced subgraph on {(e,u):eId(R),uU(R)}\{(e, u) : e \in Id^{*}(R), u \in U(R)\} is denoted by Cl2(R)Cl_2(R). In this paper, SO(Cl2(Zn))SO(Cl2(\mathbb{Z}_n)), for different values of the positive integer nn, is investigated.

Keywords

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}
}