|
|
|
|
a simple proof for the being eulerian of the power graphs p_{i}(d) for 3 ≤ i ≤ 6
|
|
|
|
|
|
|
|
نویسنده
|
mokhtarian dehkordi elham ,eshaghi gordji madjid ,moradi sirous ,yarahmadi zahra
|
|
منبع
|
mathematics interdisciplinary research - 2024 - دوره : 9 - شماره : 3 - صفحه:333 -347
|
|
چکیده
|
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.
|
|
کلیدواژه
|
directed euler trail، directed euler tour، eulerian digraph، directed power graph، eulerian power graph
|
|
آدرس
|
semnan university, faculty of mathematics, iran, semnan university, faculty of mathematics, iran, lorestan university, faculty of science, department of mathematics, iran, islamic azad university, khorramabad branch, faculty of science, department of mathematics, iran
|
|
پست الکترونیکی
|
zahra.yarahmadi@iau.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|