Generalized domination and efficient domination in graphs

DOI10.1016/0012-365X(95)00094-DzbMath0860.05044MaRDI QIDQ1126173

Peter J. Slater, Linda H. Host, David W. Bange, Anthony E. Barkauskas

Publication date: 13 April 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(Y\)-domination function\(Y\)-domination numberefficient \(Y\)-domination function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items (28)

\(k\)-subdomination in graphs ⋮ On the efficiency index of a graph ⋮ Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ A dichotomy for weighted efficient dominating sets with bounded degree vertices ⋮ From Italian domination in lexicographic product graphs to w-domination in graphs ⋮ A Taxonomy of Perfect Domination ⋮ On dominating set polyhedra of circular interval graphs ⋮ Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Efficient minus and signed domination in graphs ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ The binary locating-dominating number of some convex polytopes ⋮ On the complexity of the labeled domination problem in graphs ⋮ Unnamed Item ⋮ Variations of \(Y\)-dominating functions on graphs ⋮ Complexity of Total {k}-Domination and Related Problems ⋮ Efficient domination for classes of \(P_6\)-free graphs ⋮ Dominating functions with integer values in graphs—a survey ⋮ Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs ⋮ On efficient domination for some classes of \(H\)-free chordal graphs ⋮ On efficient domination for some classes of \(H\)-free chordal graphs ⋮ Algorithms and Complexity of Signed, Minus, and Majority Domination ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Fractional Dominating Parameters ⋮ Minimum fractional dominating functions and maximum fractional packing functions ⋮ Real and integer domination in graphs ⋮ On efficient domination for some classes of \(H\)-free bipartite graphs ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes ⋮ On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs

Cites Work

• Domination, independent domination, and duality in strongly chordal graphs
• Minus domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized domination and efficient domination in graphs