Relating the total domination number and the annihilation number for quasi-trees and some composite graphs
From MaRDI portal
Publication:2144511
DOI10.1016/j.disc.2022.112965OpenAlexW3211437821MaRDI QIDQ2144511
Xinying Hua, Sandi Klavžar, Kexiang Xu, Hong-Bo Hua
Publication date: 14 June 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.03298
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Relating the annihilation number and the 2-domination number of a tree
- Bounds on the locating-total domination number of a tree
- Total domination of graphs and small transversals of hypergraphs
- A new upper bound on the total domination number of a graph
- Bounding the locating-total domination number of a tree in terms of its annihilation number
- Relating the annihilation number and the 2-domination number of block graphs
- Relating the annihilation number and the total domination number of a tree
- The annihilation number does not bound the 2-domination number from the above
- The annihilation number and the total domination number of a tree-like graph
- A note on the annihilation number and 2-domination number of a tree
- Double graphs
- An infinite family of graphs with a facile count of perfect matchings
- On the Zero Forcing Number of Bijection Graphs
- Some remarks on domination
- Total Domination in Graphs
- DOMINATION PARAMETERS IN MYCIELSKI GRAPHS
- Relating the total domination number and the annihilation number of cactus graphs and block graphs
- Sur le coloriage des graphs
This page was built for publication: Relating the total domination number and the annihilation number for quasi-trees and some composite graphs
