Generalized domination and efficient domination in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4130427 (Why is no real title available?)
- scientific article; zbMATH DE number 3974289 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 861417 (Why is no real title available?)
- Domination, independent domination, and duality in strongly chordal graphs
- Minus domination in graphs
Cited in
(40)- A general method in the theory of domination in graphs
- Algorithms and complexity of signed, minus, and majority domination
- On the efficiency index of a graph
- Minimum fractional dominating functions and maximum fractional packing functions
- Efficient minus and signed domination in graphs
- Efficient \((j, k)\)-dominating functions
- From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
- On efficient domination for some classes of \(H\)-free bipartite graphs
- k-subdomination in graphs
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- Extremal problems related to the cardinality-redundance of graphs
- Efficient domination in knights graphs
- Signed and minus dominating functions in graphs
- Fractional dominating parameters
- A dichotomy for weighted efficient dominating sets with bounded degree vertices
- Efficient domination through eigenvalues
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- Dominating functions with integer values in graphs—a survey
- An integer programming approach for solving a generalized version of the Grundy domination number
- Generalized perfect domination in graphs
- Efficient total domination in digraphs
- scientific article; zbMATH DE number 1191209 (Why is no real title available?)
- On efficient domination for some classes of \(H\)-free chordal graphs
- scientific article; zbMATH DE number 5080622 (Why is no real title available?)
- On dominating set polyhedra of circular interval graphs
- A Taxonomy of Perfect Domination
- On the complexity of the labeled domination problem in graphs
- Real and integer domination in graphs
- Uniformity of point samples in metric spaces using gap ratio
- Uniformity of point samples in metric spaces using gap ratio
- On efficient domination for some classes of \(H\)-free chordal graphs
- On the binary locating-domination number of regular and strongly-regular graphs
- scientific article; zbMATH DE number 5914896 (Why is no real title available?)
- On efficiently total dominatable digraphs
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- Complexity of Total {k}-Domination and Related Problems
- k-Efficient domination: Algorithmic perspective
- The binary locating-dominating number of some convex polytopes
- Variations of \(Y\)-dominating functions on graphs
- Efficient domination for classes of \(P_6\)-free graphs
This page was built for publication: Generalized domination and efficient domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126173)