Title : ( Further Results on Betweenness Centrality of Graphs )
Authors: Mostafa Tavakoli ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use linkand lexicographic products to compute betweenness centrality of some important classesof graphs. Finally, we pose some open problems related to this topic.
Keywords
, Betweenness centrality, lexicographic product, tensor product, strong product
@article{paperid:1068892,
author = {Tavakoli, Mostafa},
title = {Further Results on Betweenness Centrality of Graphs},
journal = {Iranian Journal of Mathematical Chemistry},
year = {2018},
volume = {9},
number = {2},
month = {June},
issn = {2228-6489},
pages = {157--165},
numpages = {8},
keywords = {Betweenness centrality; lexicographic product; tensor product; strong product},
}
%0 Journal Article
%T Further Results on Betweenness Centrality of Graphs
%A Tavakoli, Mostafa
%J Iranian Journal of Mathematical Chemistry
%@ 2228-6489
%D 2018
