The tree-achieving set and non-separating independent set problem of subcubic graphs
Saved in:
Main Authors: | Fayun Cao, Han Ren |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2025-01-01
|
Series: | Discussiones Mathematicae Graph Theory |
Online Access: | https://www.dmgt.uz.zgora.pl/?doi=10.7151/dmgt.2522 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Maximum Independent Sets Partition of (n,k)-Star Graphs
by: Fu-Tao Hu
Published: (2019-01-01) -
Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets
by: Shiping Wang, et al.
Published: (2013-01-01) -
End super dominating sets in graphs
by: Saieed Akbari, et al.
Published: (2025-01-01) -
Maximal resolving sets in a graph
by: V. Swaminathan, et al.
Published: (2024-12-01) -
On Locating-Dominating Set of Regular Graphs
by: Anuwar Kadir Abdul Gafur, et al.
Published: (2021-01-01)