2023
DOI: 10.3934/mbe.2023539
|View full text |Cite
|
Sign up to set email alerts
|

On the offensive alliance number for the zero divisor graph of $ \mathbb{Z}_n $

Abstract: <abstract><p>A nonempty subset $ D $ of vertices in a graph $ \Gamma = (V, E) $ is said is an <italic>offensive alliance</italic>, 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 <italic>offensive alliance number</italic> $ \alpha ^o(\Gamma) $ of $ \Gamma $. An offensive alliance $ D $ is called <italic>global</italic>, if every $ v \in V… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 20 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?