On the differences between the upper irredundance, upper domination and independence numbers of a graph
From MaRDI portal
(Redirected from Publication:1301668)
Recommendations
Cites work
- Chordal graphs and upper irredundance, upper domination and independence
- Contributions to the theory of domination, independence and irredundance in graphs
- Disproof of a conjecture in the domination theory
- scientific article; zbMATH DE number 30759 (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 867653 (Why is no real title available?)
- Inequalities relating domination parameters in cubic graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- What is the difference between the domination and independent domination numbers of a cubic graph?
Cited in
(10)- Chordal graphs and upper irredundance, upper domination and independence
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Domination and irredundance in cubic graphs
- Independence, irredundance, degrees and chromatic number in graphs
- Irredundance
- The total irredundance numbers on graphs
- scientific article; zbMATH DE number 1933059 (Why is no real title available?)
- scientific article; zbMATH DE number 2163987 (Why is no real title available?)
- scientific article; zbMATH DE number 2192119 (Why is no real title available?)
This page was built for publication: On the differences between the upper irredundance, upper domination and independence numbers of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301668)