A Simple Proof for the Being Eulerian of the Power Graphs $ P_{i}(D)$ for 3 ≤ i ≤ 6
In this article, we employ a novel and unique method to analyze the Eulerian nature of the power graphs $ P_{i}(D) $ for 3 ⩽ i ⩽ 6. Then, we will mention some applications of Eulerian power graphs in computer networks.
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
University of Kashan
2024-09-01
|
| Colección: | Mathematics Interdisciplinary Research |
| Materias: | |
| Acceso en línea: | https://mir.kashanu.ac.ir/article_114482_46d84c55410ce117956de8337a5440f9.pdf |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|