Mixed domination and 2-independence in trees
From MaRDI portal
Publication:2132130
DOI10.3934/math.2020357zbMath1484.05039OpenAlexW3038302464MaRDI QIDQ2132130
Nasrin Dehgardi, Zehui Shao, Chang Wan, Asfand Fahad, Marzieh Soroudi, Rana Khoeilar
Publication date: 27 April 2022
Published in: AIMS Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/math.2020357
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
On investigations of graphs preserving the Wiener index upon vertex removal ⋮ Middle domination and 2-independence in trees
Cites Work
- New results on \(k\)-independence of graphs
- The algorithmic complexity of mixed domination in graphs
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- On total covers of graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- On the semitotal domination number of line graphs
- On the mixed domination problem in graphs
- New approach to the \(k\)-independence number of a graph
- On upper total domination versus upper domination in graphs
- An approximation algorithm for the total covering problem
- Improved lower bounds on k‐independence
- Total matchings and total coverings of graphs
- Independent Roman domination and 2-independence in trees
- Mixed Roman domination and 2-independence in trees
- Trees with equal 2-domination and 2-independence numbers
- Roman domination and 2-independence in trees
- Semitotal domination in claw-free cubic graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Mixed domination and 2-independence in trees