Common extremal graphs for three inequalities involving domination parameters

DOI10.22108/toc.2017.21464zbMath1463.05421OpenAlexW2623482620MaRDI QIDQ5134523

No author found.

Publication date: 17 November 2020

Full work available at URL: https://doaj.org/article/a09a887b9a424ef586984edfef12843b

zbMATH Keywords

efficient dominating setdomination/domatic/idomatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Changing and unchanging of the domination number of a graph: path addition numbers ⋮ On the edge geodetic and edge geodetic domination numbers of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On perfect codes in Cartesian products of graphs
• Domination, independent domination, and duality in strongly chordal graphs
• Idomatic partitions of direct products of complete graphs
• Vertex domination of generalized Petersen graphs
• Dominating sets and domatic number of circular arc graphs
• Disjoint independent dominating sets in graphs
• Linear algorithm for domatic number problem on interval graphs
• The bondage numbers and efficient dominations of vertex-transitive graphs
• On two problems of the graph theory
• Towards a theory of domination in graphs
• A Study on r-Configurations---A Resource Assignment Problem on Graphs

This page was built for publication: Common extremal graphs for three inequalities involving domination parameters