Cubic graphs have paired-domination number at most four-seventh of their orders
From MaRDI portal
Publication:2675847
Recommendations
Cites work
- A characterization of cubic graphs with paired-domination number three-fifths their order
- A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
- scientific article; zbMATH DE number 5221647 (Why is no real title available?)
- Paired domination in graphs
- Paired-domination game played in graphs
- Paired-domination in graphs
- Paired-domination number of a graph and its complement
- Upper bounds for the paired-domination numbers of graphs
Cited in
(7)- Cubic graphs with total domatic number at least two
- Upper bounds for the paired-domination numbers of graphs
- Domination parameters of the splitting graph of a graph
- Novel concepts in linear Diophantine fuzzy graphs with an application
- A note on the \(P_3\)-isolation number of a graph
- Paired domination in graphs with minimum degree four
- A characterization of cubic graphs with paired-domination number three-fifths their order
This page was built for publication: Cubic graphs have paired-domination number at most four-seventh of their orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2675847)