D. Pradhan

works on

clique number 1 graph coloring 1 maximum degree 1 P6 C4)-free graphs 1 Δ-1 coloring 1

From the 1 of 6 linked papers with an AI index.

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Coloring $(P_{6}, C_{4})$ -free graphs with $I^ - 1$ colors

Uttam K. Gupta, Dinabandhu Pradhan, Rashmi Rekha Swain

The authors show that any graph that contains no induced six-vertex path or four-vertex cycle, has maximum degree at least 9, and whose clique number is smaller than its maximum de…

math.CO2026

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…

math.CO2025

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…

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…

Coloring (P6​,C4​)-free graphs with I^−1 colors

Locating-dominating partitions for some classes of graphs

Secure domination in P5​-free graphs

Disjunctive domination in maximal outerplanar graphs

Coloring $(P_{6}, C_{4})$ -free graphs with $I^ - 1$ colors

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