A characterization of (_t,_2)-trees
From MaRDI portal
Publication:2997602
Recommendations
- Trees with large total domination number
- On the \((2,2)\)-domination number of trees
- A characterization of trees with equal domination and total domination numbers.
- A constructive characterization of trees with equal total domination and disjunctive domination numbers
- Trees with equal 2-domination and 2-independence numbers
Cited in
(19)- scientific article; zbMATH DE number 4187826 (Why is no real title available?)
- On a class of graphs with large total domination number
- scientific article; zbMATH DE number 1161337 (Why is no real title available?)
- A characterization of trees with equal domination and total domination numbers.
- scientific article; zbMATH DE number 1932300 (Why is no real title available?)
- Characterization of trees with equal 2-domination number and domination number plus two
- A proof of the dissimilarity characteristic theorem for 2-trees
- Relating the total \(\{2\}\)-domination number with the total domination number of graphs
- A constructive characterization of trees with equal total domination and disjunctive domination numbers
- Construction of trees and graphs with equal domination parameters
- A characterization of \(b_e\)-critical trees
- scientific article; zbMATH DE number 1507962 (Why is no real title available?)
- Characterizations of trees with equal domination parameters
- Certified domination
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
- \(k\)-domination and \(k\)-independence in graphs: A survey
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
- On the \((2,2)\)-domination number of trees
- Trees with large total domination number
This page was built for publication: A characterization of \((\gamma_t,\gamma_2)\)-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997602)
