16 citations · 16 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2024
The Median of Sierpinski Triangle Graphs
Kannan Balakrishnan, Manoj Changat, M V. Dhanyamol +3
The median of a graph is the set of vertices with a minimum total distance to all other vertices in the graph. In this paper, we determine the median of Sierpiński triangle…
math.CO2017
On the number of geodesics of Petersen graph
Sunil Kumar R, Kannan Balakrishnan
In any network, the interconnection of nodes by means of geodesics and the number of geodesics existing between nodes are important. There exists a class of centrality measures bas…
math.CO2016
Betweenness Centrality of Cartesian Product of Graphs
Sunil Kumar R, Kannan Balakrishnan
Betweenness centrality is a widely-used measure in the analysis of large complex networks. It measures the potential or power of a vertex to control the communication over the netw…