25 citations · 26 across the 3 of their papers we have counts for
3 papers
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…
Betweenness Centrality in Some Classes of Graphs
Sunil Kumar R, Kannan Balakrishnan, M. Jathavedan
There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ra…
Gray Level Co-Occurrence Matrices: Generalisation and Some New Features
Bino Sebastian, A. Unnikrishnan, Kannan Balakrishnan
Gray Level Co-occurrence Matrices (GLCM) are one of the earliest techniques used for image texture analysis. In this paper we defined a new feature called trace extracted from the…