Changing and unchanging domination: A classification
From MaRDI portal
Publication:1415545
DOI10.1016/S0012-365X(03)00185-7zbMath1029.05116OpenAlexW1979194672MaRDI QIDQ1415545
Michael A. Henning, Teresa W. Haynes
Publication date: 4 December 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00185-7
Related Items
Construction for trees without domination critical vertices ⋮ Critical concepts of restrained domination in signed graphs ⋮ Relations between edge removing and edge subdivision concerning domination number of a graph ⋮ Domatically perfect graphs ⋮ A characterization of domination weak bicritical graphs with large diameter ⋮ Graphs with equal domination and covering numbers ⋮ Effect of vertex deletion on the weak Roman domination number of a graph ⋮ Changing and unchanging of the domination number of a graph ⋮ Minimum fractional dominating functions and maximum fractional packing functions ⋮ Roman domination excellent graphs: trees ⋮ Unnamed Item
Cites Work
- Domination alteration sets in graphs
- An extremal problem for edge domination insensitive graphs
- Critical concepts in domination
- Hamiltonian properties of domination-critical graphs
- Vertex domination-critical graphs
- Vertices contained in every minimum dominating set of a tree
- The diameter of domination k‐critical graphs
- Independence and hamiltonicity in 3-domination-critical graphs
- Vertex domination‐critical graphs
- Domination critical graphs
- Domination critical graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item