Edge-vertex degree based Zagreb index and graph operations
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912367777939456 |
|---|---|
| author | Sinha, Amitariddhi Paul, Somnath |
| author_facet | Sinha, Amitariddhi Paul, Somnath |
| contents | A graph $G$ consists of two parts, the vertices and edges. The vertices constitute the vertex set $V(G)$ and the edges, the edge set. An edge \( e=xy \), \( ev \)-dominates not only the vertices incident to it but also those adjacent to either \( x \) or \( y \). The edge-vertex degree of $e,$ $deg^{ev}_{G}(e),$ is the number of vertices in the $ev$-dominating set of $e$. In this article, we compute expressions for the $ev$-degree version of the Zagreb index of several unary and binary graph operations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_05999 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Edge-vertex degree based Zagreb index and graph operations Sinha, Amitariddhi Paul, Somnath Combinatorics 05C09, 05C76 A graph $G$ consists of two parts, the vertices and edges. The vertices constitute the vertex set $V(G)$ and the edges, the edge set. An edge \( e=xy \), \( ev \)-dominates not only the vertices incident to it but also those adjacent to either \( x \) or \( y \). The edge-vertex degree of $e,$ $deg^{ev}_{G}(e),$ is the number of vertices in the $ev$-dominating set of $e$. In this article, we compute expressions for the $ev$-degree version of the Zagreb index of several unary and binary graph operations. |
| title | Edge-vertex degree based Zagreb index and graph operations |
| topic | Combinatorics 05C09, 05C76 |
| url | https://arxiv.org/abs/2505.05999 |