


Paper Title:
Generalized kdistancebalanced Graphs
Author(s):
Amir Hosseini and Mehdi Alaeiyan
Department of mathematics, Karaj Branch,
Islamic Azad university, Karaj,
Iran.
Email: amir.hosseini@kiau.ac.ir,
hosseini.sam.52@gmail.com
Department of Mathematics,
Iran University of Science and Technology, Tehran,
Iran.
Email: alaeiyan@iust.ac.ir
Abstract:
A nonempty graph Γ is called generalized kdistancebalanced, whenever every edge ab has the following property: the number of vertices closer to a than to b, k^{, }times of vertices closer to b than to a, or conversely, k∈ N .In this paper we determine some families of graphs that have this property, as well as to prove some other result regarding these graphs.
Full Text PDF: