1 citations · 1 across the 5 of their papers we have counts for
6 papers
Disjoint Total Dominating Sets in Near-Triangulations
P. Francis, Abraham M. Illickan, Lijo M. Jose +1
We show that every simple planar near-triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulati…
-binding functions for some classes of -free graphs
Athmakoori Prashant, P. Francis, S. Francis Raj
The class of -free graphs have been well studied in various contexts in the past. It is known that the class of -free graphs and $\{2K_2,(K_1\cup K_2)+K_p\…
On Domatic and Total Domatic Numbers of Product Graphs
P. Francis, Deepak Rajendraprasad
A \emph{domatic} (\emph{total domatic}) \emph{-coloring} of a graph is an assignment of colors to the vertices of such that each vertex contains vertices of all …
Bounds for the b-chromatic number of powers of hypercubes
P. Francis, S. Francis Raj, M. Gokulnath
The b-chromatic number of a graph is the maximum for which has a proper vertex coloring using colors such that each color class contains at least one vertex…
On indicated coloring of lexicographic product of graphs
P. Francis, S. Francis Raj, M. Gokulnath
Indicated coloring is a graph coloring game in which two players collectively color the vertices of a graph in the following way. In each round the first player (Ann) selects a ver…
On indicated coloring of some classes of graphs
P. Francis, S. Francis Raj, M. Gokulnath
Indicated coloring is a type of game coloring in which two players collectively color the vertices of a graph in the following way. In each round the first player (Ann) selects a v…