Classification of Nicely Edge Distance-Balanced Graphs

عنوان به زبان ديگر

پديدآورندگان

Zeinloo Saharnaz Karaj Branch, Islamic Azad University, , Alaeiyan Mehdi Karaj Branch, Islamic Azad University,

تعداد صفحه

10

كليدواژه

Distance , Diameter , Distance , balanced graph , Edge distance , balanced graph , Nicely distance , balanced graph.

سال انتشار

1396

عنوان كنفرانس

دومين كنفرانس ملي تركيبيات رمزنگاري و محاسبات

زبان مدرك

انگليسي

چكيده فارسي

A nonempty graph is called nicely edge distance-balanced (as brief we can say NEDB), whenever there exists a positive integer , such that for any edge say we have: . Which denotes the number of edges laying closer to the vertex than vertex and is defined analogously. In this paper, we study on NEDB graph and it’s basic properties and some operations. Also, we try to classify some families of graphs with related .

چكيده لاتين

A nonempty graph is called nicely edge distance-balanced (as brief we can say NEDB), whenever there exists a positive integer , such that for any edge say we have: . Which denotes the number of edges laying closer to the vertex than vertex and is defined analogously. In this paper, we study on NEDB graph and it’s basic properties and some operations. Also, we try to classify some families of graphs with related .

كشور

ايران