Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2505.10090 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912418673721344 |
|---|---|
| author | Badie, M. Nikandish, R. Pirniia, M. |
| author_facet | Badie, M. Nikandish, R. Pirniia, M. |
| contents | Let $G = (V, E)$ be a graph with the vertex set $V (G)$ and edge set $E(G)$. The Sombor index of $G$, $SO(G)$, is defined as $\sum_{uv\in E(G)} \sqrt{deg(u)^2 + deg(v)^2}$, where $deg(u)$ is the degree of vertex $u$ in $V (G)$. The clean graph of a ring R, denoted by $Cl(R)$, is a graph with vertex set $\{(e, u) : e \in Id(R), u \in U(R)\}$ and two distinct vertices $(e, u)$ and$(f, v)$ are adjacent if and only if $ef = 0$ or $uv = 1$ ($Id(R)$ and $U(R)$ are the sets of idempotents and unit elements of R, respectively). The induced subgraph on $\{(e, u) : e \in Id^{*}(R), u \in U(R)\}$ is denoted by $Cl_2(R)$. In this paper, $SO(Cl2(\mathbb{Z}_n))$, for different values of the positive integer $n$, is investigated. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_10090 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sombor index of clean graphs Badie, M. Nikandish, R. Pirniia, M. Combinatorics Let $G = (V, E)$ be a graph with the vertex set $V (G)$ and edge set $E(G)$. The Sombor index of $G$, $SO(G)$, is defined as $\sum_{uv\in E(G)} \sqrt{deg(u)^2 + deg(v)^2}$, where $deg(u)$ is the degree of vertex $u$ in $V (G)$. The clean graph of a ring R, denoted by $Cl(R)$, is a graph with vertex set $\{(e, u) : e \in Id(R), u \in U(R)\}$ and two distinct vertices $(e, u)$ and$(f, v)$ are adjacent if and only if $ef = 0$ or $uv = 1$ ($Id(R)$ and $U(R)$ are the sets of idempotents and unit elements of R, respectively). The induced subgraph on $\{(e, u) : e \in Id^{*}(R), u \in U(R)\}$ is denoted by $Cl_2(R)$. In this paper, $SO(Cl2(\mathbb{Z}_n))$, for different values of the positive integer $n$, is investigated. |
| title | Sombor index of clean graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2505.10090 |