ABSTRACT
A previously conjectured result, from Everett, Sinclair and Dankelmann (Citation2004), on the upper bound for a centralization index in bipartite graphs, when used with the betweenness index of vertex centrality, is proved.
The Journal of Mathematical Sociology
Volume 29, 2004 - Issue 1
![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})