|
|
|
|
Note on edge distance-balanced graph
|
|
|
|
|
|
|
|
نویسنده
|
Tavakoli M. ,Yousefi-Azari H. ,Ashrafi Alireza
|
|
منبع
|
transactions on combinatorics - 2012 - دوره : 1 - شماره : 1 - صفحه:1 -6
|
|
چکیده
|
Edge distance-balanced graphs are graphs in which for every edge e = uv the number of edges closer to vertex u than to vertex v is equal to the number of edges closer to v than to u. in this paper, we study this property under some graph operations
|
|
کلیدواژه
|
Edge distance-balanced; vertex distance-balanced; graph operation
|
|
آدرس
|
university of tehran, School of Mathematics, Statistics and Computer Science, ایران, university of tehran, School of Mathematics, Statistics and Computer Science, ایران, university of kashan, Faculty of Mathematics, Statistics and Computer Science, Department of Mathematics, ایران
|
|
پست الکترونیکی
|
ashrafi@kashanu.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|