Graphs with diameter 2 and large total domination number
From MaRDI portal
Publication:2657085
DOI10.1007/s00373-020-02245-xzbMath1459.05236OpenAlexW3094760710MaRDI QIDQ2657085
Publication date: 17 March 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-020-02245-x
Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Signed total Roman domination in graphs
- On \(\alpha\)-total domination in graphs
- A note on \(\alpha\)-total domination in cubic graphs
- Total \(k\)-domination in Cartesian product graphs
- Secure total domination in graphs: bounds and complexity
- m-Eternal total domination in graphs
- Total Domination in Graphs with Diameter 2
- Disjunctive total domination in permutation graphs
- Bounds on the Global Domination Number
- Secure domination and secure total domination in graphs
- Total domination in graphs
- Total Domination in Graphs
- Bounds on weak and strong total domination in graphs
- A Transition from Total Domination in Graphs to Transversals in Hypergraphs
- On the Concentration of the Domination Number of the Random Graph
- On the domination number of a random graph