23 citations · 45 across the 10 of their papers we have counts for
13 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…
Predicting Stability of Community Members in Complex Networks
Sruthi K S, Divya Sindhu Lekha, A Sreekumar +1
In this work, we analyse and predict the stability of communities in complex networks. We use a variant of closeness centrality, known as profile closeness, to measure the loyalty…
Generalized Vertex Transitivity in Graphs
Kannan Balakrishnan, Divya Sindhu Lekha, Manoj Changat +2
In this paper, we introduce a generalized concept of vertex transitivity in graphs called generalized vertex transitivity. We put forward a new invariant called transitivity number…
Attack Vulnerability of Complex Networks in Center-Based Strategies
Divya Sindhu Lekha, Kannan Balakrishnan
Central nodes are critical in establishing structural connectivity in a complex network. Attacking such nodes can create real havoc in a complex system. We propose attack strategie…
Offline Handwritten Recognition of Malayalam District Name - A Holistic Approach
Jino P J, Kannan Balakrishnan
Various machine learning methods for writer independent recognition of Malayalam handwritten district names are discussed in this paper. Data collected from 56 different writers ar…
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…