A characterization of graphs with semitotal domination number one-third their order
From MaRDI portal
Publication:6580490
DOI10.1007/S00373-024-02800-WzbMATH Open1544.05075MaRDI QIDQ6580490FDOQ6580490
Authors: Jie Chen, Cai-Xia Wang, Yi-Ping Liang, S. J. Xu 
Publication date: 29 July 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical
- Algorithmic aspects of semitotal domination in graphs
- Bounds on domination parameters in graphs: a brief survey
- Bounds on total domination in claw-free cubic graphs
- Domination in intersecting hypergraphs
- Edge weighting functions on semitotal dominating sets
- Locating-total domination in claw-free cubic graphs
- On a conjecture on total domination in claw-free cubic graphs
- On matching and semitotal domination in graphs
- On matching and total domination in graphs
- On the semitotal domination number of line graphs
- Paired-domination in claw-free cubic graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in graphs
- Total domination in graphs
This page was built for publication: A characterization of graphs with semitotal domination number one-third their order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580490)
