Restrained domination in self-complementary graphs
From MaRDI portal
Publication:2227117
DOI10.7151/dmgt.2222zbMath1458.05192OpenAlexW2942744991WikidataQ127959489 ScholiaQ127959489MaRDI QIDQ2227117
Michael A. Henning, Teresa W. Haynes, Wyatt J. Desormeaux
Publication date: 10 February 2021
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2222
Related Items (2)
Restrained domination and its variants in extended supergrid graphs ⋮ Restrained and Total Restrained Domination in Graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted restrained domination in subclasses of planar graphs
- Equality in a bound that relates the size and the restrained domination number of a graph
- A characterization of trees with equal independent domination and secure domination numbers
- Graphs with large restrained domination number
- Restrained domination in graphs
- Construction of self-complementary graphs
- Domination parameters of a graph and its complement
- Restrained domination in trees
- Construction of trees and graphs with equal domination parameters
- A graph and its complement with specified properties. IV. Counting self-complementary blocks
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Characterizations of trees with equal domination parameters
- Total Domination in Graphs
- Further results on secure restrained domination in graphs
- Claw-free graphs with equal 2-domination and domination numbers
- Asymmetric graphs
- Self-complementary graphs
This page was built for publication: Restrained domination in self-complementary graphs
