5 citations · 7 across the 5 of their papers we have counts for
6 papers · 1 filter
Partial Domination in Prisms of Graphs
L. Philo Nithya, Joseph Varghese Kureethara
For any graph G = (V, E) and proportion , a set is a p-dominating set if . The -domination number equals the minim…
Maximum Number of Non-Intersecting Diagonals in Square Arrays
Marbarisha M. Kharkongor, Joseph Varghese Kureethara
In this paper, we derive a formula to express the maximum number of non-intersecting diagonals of arbitrary length that can be drawn in n x n square arrays, where n is a multiple o…
Parity Labeling in Signed Graphs
Mukti Acharya, Joseph Varghese Kureethara
Let be a signed graph where is a graph called the underlying graph of and . Let suc…
Characterizations of Some Parity Signed Graphs
Mukti Acharya, Joseph Varghese Kureethara, Thomas Zaslavsky
We describe parity labelings of signed graphs; equivalently, cuts of the underlying graph that have nearly equal sides. We characterize the balanced signed graphs which are parity…
Line Completion Number of Grid Graph
Joseph Varghese Kureethara, Merin Sebastian
The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least edges, the super line graph of index , , has…
L(t, 1)-Colouring of Graphs
Priyanka Pandey, Joseph Varghese Kureethara
One of the most famous applications of Graph Theory is in the field of Channel Assignment Problems. There are varieties of graph colouring concepts that are used for different requ…