J. V. Kureethara

activity

20202022

most citedPartial Domination in Prisms of Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

4 papers

math.CO2022★ 1 cited

Partial Domination in Prisms of Graphs

L. Philo Nithya, Joseph Varghese Kureethara

For any graph G = (V, E) and proportion $p \in (0, 1]$ , a set $S \subseteq V$ is a p-dominating set if $\frac{∣ N [ S ] ∣}{∣ V ∣} \geq p$ . The $p$ -domination number $γ_{p} (G)$ equals the minim…

math.CO2021

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…

math.CO2020

Parity Labeling in Signed Graphs

Mukti Acharya, Joseph Varghese Kureethara

Let $S = (G, σ)$ be a signed graph where $G = (V, E)$ is a graph called the underlying graph of $S$ and $σ : E (G) \to {+, -}$ . Let $f : V (G) \to {1, 2, \dots, ∣ V (G) ∣}$ suc…

math.CO2020

Line Completion Number of Grid Graph $P_{n} \times P_{m}$

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 $r$ edges, the super line graph of index $r$ , $L_{r} (G)$ , has…

Partial Domination in Prisms of Graphs

Maximum Number of Non-Intersecting Diagonals in Square Arrays

Parity Labeling in Signed Graphs

Line Completion Number of Grid Graph Pn​×Pm​

Line Completion Number of Grid Graph $P_{n} \times P_{m}$