1 citations · 1 across the 2 of their papers we have counts for
5 papers
Wiener index and Steiner 3-Wiener index of a graph
Matjaž Kovše, Rasila V A, Ambat Vijayakumar
Let be a set of vertices of a connected graph . The Steiner distance of is the minimum size of a connected subgraph of containing all the vertices of . The sum of…
Steiner Wiener index of block graphs
Matjaž Kovše, Rasila V A, Ambat Vijayakumar
Let be a set of vertices of a connected graph . The Steiner distance of is the minimum size of a connected subgraph of containing all the vertices of . The Steine…
Heredity for generalized power domination
Paul Dorbec, Seethu Varghese, Ambat Vijayakumar
In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction. We…
Generalized power domination in WK-Pyramid Networks
Seethu Varghese, A. Vijayakumar
The notion of power domination arises in the context of monitoring an electric power system with as few phase measurement units as possible. The power domination number of a gr…
On split graphs with four distinct eigenvalues
Felix Goldberg, Steve Kirkland, Anu Varghese +1
It is a well-known fact that a graph of diameter has at least eigenvalues. Let us call a graph \emph{-extremal} if it has diameter and exactly eigenvalues. S…