given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...

The disjoint domination number γγ(G) of a graph G is the minimum cardinality of the union of two disjoint dominating sets in G. The disjoint independent domination number of a graph G is the minimum cardinality of the union of two disjoint independent dominating sets in G. In this paper we study these two parameters. We determine the value of γγ(G) for several graphs and give partial answers to...

Let k¿2; n=2+1; and let m0; : : : ; mk−1 each be a multiple of n. The graph Cm0×· · ·×Cmk−1 consists of isomorphic connected components, each of which is (n − 1)-regular and admits of a vertex partition into n smallest independent dominating sets. Accordingly, (independent) domination number of each connected component of this graph is equal to (1=n)th of the number of vertices in it. ? 2001 El...

For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if the subgraph induced by S has the property P. Then the P-domination number of G is the minimum cardinality of a dominating P-set and the P-independence number the maximum cardinality of a P-set. We show that several properties of domination, independent domination and acyclic domination hold for ...

For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if the subgraph induced by S has the property P. Then the P-domination number of G is the minimum cardinality of a dominating P-set and the P-independence number the maximum cardinality of a P-set. We show that several properties of domination, independent domination and acyclic domination hold for ...

A dominating set D of an IFG G = (V, E) is a non-split dominating set, if the induced intuitionistic fuzzy subgraph 〈ܸ − ‫〉ܦ‬ is connected. The Non-split domination number ߛ ௡௦ ሺ‫ܩ‬ሻ of IFG G is the minimum cardinality of all Non-split dominating set. In this paper we study some theorems in Non-split dominating sets of IFG and some results of ߛ ௡௦ ሺ‫ܩ‬ሻwith other known parameters of IFG G. 1. In...

Supergrid graphs are derived by computing stitch paths for computerized embroidery machines. In the past, we have studied Hamiltonian-related properties of supergrid and their subclasses graphs. this paper, propose a generalized graph class called extended Extended include grid graphs, diagonal triangular as study problems domination independent on A dominating set is subset vertices it, such t...

a {em roman dominating function} on a graph $g$ is a function$f:v(g)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}a {em restrained roman dominating}function} $f$ is a {color{blue} roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} the wei...

for any $k in mathbb{n}$, the $k$-subdivision of graph $g$ is a simple graph $g^{frac{1}{k}}$, which is constructed by replacing each edge of $g$ with a path of length $k$. in [moharram n. iradmusa, on colorings of graph fractional powers, discrete math., (310) 2010, no. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $g$ has been introduced as a fractional power of $g$, denoted by ...