Title : ( Some results on distanced-balanced and strongly distanced-balanced graphs )
Authors: Hamed Faramarzi , Freydoon Rahbarnia , Mostafa Tavakoli ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
Distance-balanced graphs are graphs in which for every edge e = uv the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. The graph is strongly distance-balanced if the relation holds for every distance of i which 0 ≤ i ≤ diam(G). In this paper, we study some local properties of them and also under some graph operations. Keywords: Distance-balanced Graph, Strong
Keywords
, Distance-balanced Graph, Strongly Distance-balanced Graph, Graph In-variant, Graph Operation.
@article{paperid:1062882,
author = {Faramarzi, Hamed and Rahbarnia, Freydoon and Tavakoli, Mostafa},
title = {Some results on distanced-balanced and strongly distanced-balanced graphs},
journal = {Italian Journal of Pure and Applied Mathematics},
year = {2017},
volume = {9},
number = {40},
month = {October},
issn = {1126-8042},
pages = {98--107},
numpages = {9},
keywords = {Distance-balanced Graph; Strongly Distance-balanced Graph; Graph In-variant; Graph Operation.},
}
%0 Journal Article
%T Some results on distanced-balanced and strongly distanced-balanced graphs
%A Faramarzi, Hamed
%A Rahbarnia, Freydoon
%A Tavakoli, Mostafa
%J Italian Journal of Pure and Applied Mathematics
%@ 1126-8042
%D 2017
