Extremal problems related to the cardinality-redundance of graphs
From MaRDI portal
Publication:6072050
Recommendations
Cites work
- An extremal problem for edge domination insensitive graphs
- An extremal problem for total domination stable graphs upon edge removal
- Generalized domination and efficient domination in graphs
- Graphs with maximum size and given paired-domination number
- scientific article; zbMATH DE number 4130427 (Why is no real title available?)
- scientific article; zbMATH DE number 4150229 (Why is no real title available?)
- scientific article; zbMATH DE number 4057564 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Maximum graphs with a unique minimum dominating set
- Maximum sizes of graphs with given domination parameters
- Maximum sizes of graphs with given restrained domination numbers
- Perfect codes in graphs
- Some bounds on the size of DI-pathological graphs
- The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)
Cited in
(2)
This page was built for publication: Extremal problems related to the cardinality-redundance of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072050)