Co-Secure Domination Number in Some Graphs
Let <i>G</i> be a graph and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>S</mi><mo>⊆</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo&...
Saved in:
Main Authors: | Jiatong Cui, Tianhao Li, Jiayuan Zhang, Xiaodong Chen, Liming Xiong |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-12-01
|
Series: | Axioms |
Subjects: | |
Online Access: | https://www.mdpi.com/2075-1680/14/1/10 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Complexity of Computation of Dominating Sets in Geo-Mathmetics Algorithm : A Review
by: Şakir Işleyen
Published: (2021-02-01) -
On Roman balanced domination of graphs
by: Mingyu Zhang, et al.
Published: (2024-12-01) -
Vulnerability parameters in picture fuzzy soft graphs and their applications to locate a diagnosis center in cities
by: R. V Jaikumar, et al.
Published: (2024-03-01) -
Perfectness of the essential graph for modules over commutative rings
by: Fatemeh Soheilnia, et al.
Published: (2025-02-01) -
Two Approaches to Constructing Certified Dominating Sets in Social Networks
by: Joanna Raczek, et al.
Published: (2025-01-01)