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
-
Independent Dominating Set on Chain of Fuzzy Graphs
by: Russel H. Majeed, et al.
Published: (2023-10-01) -
Independent 2-point set domination in graphs with specified girth
by: Deepti Jain
Published: (2025-04-01) -
A greedy approach to solve maximum independent set problem: Differential Malatya independent set algorithm
by: Furkan Öztemiz
Published: (2025-03-01) -
A robust and efficient algorithm for graph coloring problem based on Malatya centrality and sequent independent sets
by: Selman Yakut
Published: (2025-06-01) -
Efficient identification of maximum independent sets in stochastic multilayer graphs with learning automata
by: Mohammad Mehdi Daliri Khomami, et al.
Published: (2024-12-01)