All Title Author
Keywords Abstract

-  2018 


DOI: 10.13543/j.bhxbzr.2018.01.018

Keywords: 图论不变量,离心距离,三圈图,
graph invariant
,eccentric distance sum,tricyclic graphs

Full-Text   Cite this paper   Add to My Lib


Abstract:The eccentric distance sum (EDS) has been widely used in the fields of chemistry and biology. In order to study its mathematical properties further, a new method has been used in this paper. Firstly, three transformations of edge-grafting on the eccentricity distance sum of a connected graph were studied. Then by using these transformations and induction, we obtained the minimum eccentric distance sum among all tricyclic graphs with order n, and also characterized the structure of the corresponding tricyclic graphs. The results demonstrate that our method is simple and effective, and offers a new way of studying the eccentric distance sum of general graphs.


comments powered by Disqus