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‎.

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2024-09-01
DOI
https://doi.org/10.22052/mir.2024.253450.1432
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Simple Proof for the Being Eulerian of the Power Graphs $ P_{i}(D)$ for 3 ≤ i ≤ 6

SHILAP Revista de lepidopterología
Graph theory and applications
article

A Simple Proof for the Being Eulerian of the Power Graphs $ P_{i}(D)$ for 3 ≤ i ≤ 6

article en

Abstract

‎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‎.

SHILAP Revista de lepidopterología
Lorestan University (IR), Islamic Azad University, Khorramabad Branch (IR), Semnan University (IR)
Openalex Percentile: Top 44%
Graph theory and applications
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Simple Proof for the Being Eulerian of the Power Graphs $ P_{i}(D)$ for 3 ≤ i ≤ 6 · SHILAP Revista de lepidopterología (2024) | TGRS Research Map | TGRS