-
-
-
Open Access Article
1 - On nicely distance-balanced of folded cube graphs
Seyedeh Maryam Hosseini pour Freydoon Rahbarnia Mehdi Alaeiyan Ahmad ErfanianA nontrivial graph is called nicely distance-balanced (nicely edge distance-balanced), whenever there exist positive integers γ_V (γ_E), such that for any adjacent vertices u and v in V(Γ), there are exactly γ_V vertices in V(Γ) (γ_E MoreA nontrivial graph is called nicely distance-balanced (nicely edge distance-balanced), whenever there exist positive integers γ_V (γ_E), such that for any adjacent vertices u and v in V(Γ), there are exactly γ_V vertices in V(Γ) (γ_E edges in E(Γ) that are closer to u than v, and exactly γ_V vertices in V(Γ) (γ_E edges in E(Γ)) that are closer to v than u. In this paper, we will prove that hyper cube Q_n and the folded cube F_n are nicely distance-balanced and Q_n is also nicely edge distance-balanced.A nontrivial graph is called nicely distance-balanced (nicely edge distance-balanced), whenever there exist positive integers γ_V (γ_E), such that for any adjacent vertices u and v in V(Γ), there are exactly γ_V vertices in V(Γ) (γ_E edges in E(Γ) that are closer to u than v, and exactly γ_V vertices in V(Γ) (γ_E edges in E(Γ)) that are closer to v than u. In this paper, we will prove that hyper cube Q_n and the folded cube F_n are nicely distance-balanced and Q_n is also nicely edge distance-balanced. Manuscript profile
List of Articles احمد عرفانیان
-
The rights to this website are owned by the Raimag Press Management System.
Copyright © 2021-2024