On the offensive alliance number for the zero divisor graph of $ \mathbb{Z}_n $
A nonempty subset $ D $ of vertices in a graph $ \Gamma = (V, E) $ is said is an <i>offensive alliance</i>, if every vertex $ v \in \partial(D) $ satisfies $ \delta_D(v) \geq \delta_{\overline{D}}(v) + 1 $; the cardinality of a minimum offensive alliance of $ \Gamma $ is called the <i...
Main Authors: | José Ángel Juárez Morales, Jesús Romero Valencia, Raúl Juárez Morales, Gerardo Reyna Hernández |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2023-05-01
|
Series: | Mathematical Biosciences and Engineering |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/mbe.2023539?viewType=HTML |
Similar Items
-
On Global Offensive Alliance in Zero-Divisor Graphs
by: Raúl Juárez Morales, et al.
Published: (2022-01-01) -
Review and Support of the Relationship between Alliance Competence and Alliance Orientation
by: Gonzalo R. Llanos-Herrera, et al.
Published: (2023-01-01) -
Review and Support of the Relationship between Alliance Competence and Alliance Orientation
by: Gonzalo R. Llanos-Herrera, et al.
Published: (2023-01-01) -
Review and Support of the Relationship between Alliance Competence and Alliance Orientation
by: Gonzalo R. Llanos-Herrera, et al.
Published: (2017-11-01) -
Researching strategic alliances : emerging perspectives /
by: Das, T. K. (Tushar Kanti), 1938-
Published: (c201)