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.
Kaydedildi:
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
University of Kashan
2024-09-01
|
| Seri Bilgileri: | Mathematics Interdisciplinary Research |
| Konular: | |
| Online Erişim: | https://mir.kashanu.ac.ir/article_114482_46d84c55410ce117956de8337a5440f9.pdf |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|