P. Maniya

most citedSecure domination in

P_{5}

-free graphs

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

collaborators

5 papers

math.CO2026

Perfect divisibility and perfect-Pollyanna in bull-free graphs

Ran Chen, Paras Vinubhai Maniya, Di Wu +1

A graph $G$ is {\em perfectly divisible} if, for each induced subgraph $H$ of $G$ , $V (H)$ can be partitioned into $A$ and $B$ such that $H [A]$ is perfect and $ω (H [B]) < ω (H)$ . A {\em…

math.CO2025

Locating-dominating partitions for some classes of graphs

Florent Foucaud, Paras Vinubhai Maniya, Kaustav Paul +1

A dominating set of a graph $G$ is a set $D \subseteq V (G)$ such that every vertex in $V (G) ∖ D$ is adjacent to at least one vertex in $D$ . A set $L \subseteq V (G)$ is a loc…

cs.DM2025

$4 K_{1}$ -free graph with the cop number $3$

Arnab Char, Paras Vinubhai Maniya, Dinabandhu Pradhan

The game of cops and robber is a two-player turn-based game played on a graph where the cops try to capture the robber. The cop number of a graph $G$ , denoted by $c (G)$ is the mini…

math.CO2025

Disjunctive domination in maximal outerplanar graphs

Michael A. Henning, Paras Vinubhai Maniya, Dinabandhu Pradhan

A disjunctive dominating set of a graph $G$ is a set $D \subseteq V (G)$ such that every vertex in $V (G) ∖ D$ has a neighbor in $D$ or has at least two vertices in $D$ at dis…

math.CO2025★ 1 cited

Secure domination in $P_{5}$ -free graphs

Uttam K. Gupta, Michael A. Henning, Paras Vinubhai Maniya +1

A dominating set of a graph $G$ is a set $S \subseteq V (G)$ such that every vertex in $V (G) ∖ S$ has a neighbor in $S$ , where two vertices are neighbors if they are adjacen…