Advances and Applications in Discrete Mathematics

The Advances and Applications in Discrete Mathematics is a prestigious peer-reviewed journal indexed in the Emerging Sources Citation Index (ESCI). It is dedicated to publishing original research articles in the field of discrete mathematics and combinatorics, including topics such as graphs, coding theory, and block design. The journal emphasizes efficient and powerful tools for real-world applications and welcomes expository articles that highlight current developments in the field.

Submit Article

SOME CHARACTERIZATIONS OF 1-MOVABLE RESTRAINED CONNECTED DOMINATING SETS IN THE JOIN OF GRAPHS

Authors

  • Aida T. Lumagod
  • Renario G. Hinampas
  • Jocecar L. Hinampas

Keywords:

restrained connected domination, 1-movable domination, 1-movable restrained connected domination.

DOI:

https://doi.org/10.17654/0974165823047

Abstract

Let $G$ be a connected graph. A set $S \subseteq V(G)$ is a 1-movable restrained connected dominating set in $G$ if $S=V(G)$ or $S$ is a restrained connected dominating set of $G$ and for every $v \in S$, either $S \backslash\{v\}$ is a restrained connected dominating set or there exists a vertex $u \in(V(G) \backslash S) \cap N_G(v)$ such that $(S \backslash\{v\}) \bigcup\{u\}$ is a restrained connected dominating set of $G$. The 1-movable restrained connected domination number of $G$, denoted by $\gamma_{m r c}^1(G)$, is the smallest cardinality of a 1-movable restrained connected dominating set of $G$. A 1-movable restrained connected dominating set with cardinality $\gamma_{m r c}^1(G)$ is called a $\gamma_{m r c}^1$-set in $G$. This paper characterizes 1movable restrained connected dominating set in the join of two graphs.

References

J. Blair, R. Gera and S. Horton, Movable dominating sensor sets in networks, Journal of Combinatorial Mathematics and Combinatorial Computing 77 (2011), 103-123.

A. G. Cabaro and S. R. Canoy, Jr., Restrained connected domination in a graph, Applied Mathematical Sciences 9(4) (2015), 199-207.

G. S. Domke, J. H. Hattingh, S. T. Hedetniemi, R. C. Laskar and L. R. Markus, Restrained domination in graphs, Discrete Mathematics 203 (1999), 61-69.

R. G. Hinampas, Jr. and S. R. Canoy, Jr., 1-movable domination in graphs, Applied Mathematical Sciences 8(172) (2014), 8565-8571.

J. Lomarda and S. R. Canoy, Jr., 1-movable connected dominating sets in graphs, Applied Mathematical Sciences 9(11) (2015), 507-514.

Published

2023-06-06

Issue

Section

Articles

How to Cite

SOME CHARACTERIZATIONS OF 1-MOVABLE RESTRAINED CONNECTED DOMINATING SETS IN THE JOIN OF GRAPHS. (2023). Advances and Applications in Discrete Mathematics, 39(2), 197-207. https://doi.org/10.17654/0974165823047

Similar Articles

1-10 of 75

You may also start an advanced similarity search for this article.