Javascript must be enabled to continue!
2-STEP MOVABILITY OF POINTWISE NON-DOMINATING SETS IN A GRAPH
View through CrossRef
Let $G$ be a simple undirected graph with vertex and edge sets $V(G)$ and $E(G)$, respectively. Then a set $S\subseteq V(G)$ is a pointwise non-dominating set if for each $v \in V(G)\setminus S$, there exists $w \in S$ such that $vw \notin E(G)$. A pointwise non-dominating set $S$ is 2-step movable pointwise non-dominating if for each $x \in S$, $S \setminus \{x\}$ or $[S \setminus \{x\}] \cup \{y\}$ for some $y \in (V(G) \setminus S) \setminus N_G(x)$, is pointwise non-dominating. The minimum cardinality of a 2-step movable pointwise non-dominating set, denoted $[pnd]_m^2 (G)$, is called the 2-step movable pointwise non-domination number of $G$. In this paper, we characterize those graphs which admit a 2-step movable pointwise non-dominating set and give bounds on the 2-step movable pointwise non-domination number of a graph. We also determine the 2-step movable pointwise non-domination number of some classes of graphs. Moreover, we use the newly defined concept to characterize the 2-step movable hop dominating sets in the join of graphs and determine the value of the corresponding parameter on this graph.
Pushpa Publishing House
Title: 2-STEP MOVABILITY OF POINTWISE NON-DOMINATING SETS IN A GRAPH
Description:
Let $G$ be a simple undirected graph with vertex and edge sets $V(G)$ and $E(G)$, respectively.
Then a set $S\subseteq V(G)$ is a pointwise non-dominating set if for each $v \in V(G)\setminus S$, there exists $w \in S$ such that $vw \notin E(G)$.
A pointwise non-dominating set $S$ is 2-step movable pointwise non-dominating if for each $x \in S$, $S \setminus \{x\}$ or $[S \setminus \{x\}] \cup \{y\}$ for some $y \in (V(G) \setminus S) \setminus N_G(x)$, is pointwise non-dominating.
The minimum cardinality of a 2-step movable pointwise non-dominating set, denoted $[pnd]_m^2 (G)$, is called the 2-step movable pointwise non-domination number of $G$.
In this paper, we characterize those graphs which admit a 2-step movable pointwise non-dominating set and give bounds on the 2-step movable pointwise non-domination number of a graph.
We also determine the 2-step movable pointwise non-domination number of some classes of graphs.
Moreover, we use the newly defined concept to characterize the 2-step movable hop dominating sets in the join of graphs and determine the value of the corresponding parameter on this graph.
Related Results
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Effect of Shale Reservoir Characteristics on Shale Oil Movability in the Lower Third Member of the Shahejie Formation, Zhanhua Sag
Effect of Shale Reservoir Characteristics on Shale Oil Movability in the Lower Third Member of the Shahejie Formation, Zhanhua Sag
AbstractTo reveal the effect of shale reservoir characteristics on the movability of shale oil and its action mechanism in the lower third member of the Shahejie Formation (Es3l), ...
Nonsplit Neighbourhood Tree Domination Number In Connected Graphs
Nonsplit Neighbourhood Tree Domination Number In Connected Graphs
: Let G = (V, E) be a connected graph. A subset D of V is called a dominating set of G if N[D] = V. The minimum cardinality of a dominating set of G is called the domination number...
Domination of polynomial with application
Domination of polynomial with application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Some New Results on Domination and Independent Dominating Set of Some Graphs
Some New Results on Domination and Independent Dominating Set of Some Graphs
One area of graph theory that has been studied in great detail is dominance in graphs. Applications for dominating sets are numerous. In wireless networking, dominant sets are used...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Graph data warehousing
Graph data warehousing
Over the last decade, we have witnessed the emergence of networks in a wide spectrum of application domains, ranging from social and information networks to biological and transpor...
DOMINATING COVER OF GRAPHS
DOMINATING COVER OF GRAPHS
Let $G=(V,E)$ be a simple graph. Then a set $S \subseteq V(G)$ is called a dominating set if every vertex $v \in V(G) \backslash S$ is adjacent to at least one vertex $u \in S$. Th...

