Restrained domination in self-complementary graphs
From MaRDI portal
Publication:2227117
Recommendations
- Restrained domination in complementary prisms
- The product of the restrained domination numbers of a graph and its complement
- All graphs with restrained domination number three less than their order
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- Restrained domination in graphs
Cites work
- A characterization of trees with equal independent domination and secure domination numbers
- A graph and its complement with specified properties. IV. Counting self-complementary blocks
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Asymmetric graphs
- Characterizations of trees with equal domination parameters
- Claw-free graphs with equal 2-domination and domination numbers
- Construction of self-complementary graphs
- Construction of trees and graphs with equal domination parameters
- Domination parameters of a graph and its complement
- Equality in a bound that relates the size and the restrained domination number of a graph
- Further results on secure restrained domination in graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Graphs with large restrained domination number
- scientific article; zbMATH DE number 50596 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1507962 (Why is no real title available?)
- scientific article; zbMATH DE number 6820568 (Why is no real title available?)
- scientific article; zbMATH DE number 840694 (Why is no real title available?)
- scientific article; zbMATH DE number 3194323 (Why is no real title available?)
- Restrained domination in graphs
- Restrained domination in trees
- Self-complementary graphs
- The product of the total restrained domination numbers of a graph and its complement
- Total domination in graphs
- Weighted restrained domination in subclasses of planar graphs
Cited in
(3)
This page was built for publication: Restrained domination in self-complementary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227117)