Pages that link to "Item:Q1126173"
From MaRDI portal
The following pages link to Generalized domination and efficient domination in graphs (Q1126173):
Displaying 38 items.
- On the efficiency index of a graph (Q266040) (← links)
- Efficient domination through eigenvalues (Q317399) (← links)
- Efficient total domination in digraphs (Q450576) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- Minimum fractional dominating functions and maximum fractional packing functions (Q1025952) (← links)
- Real and integer domination in graphs (Q1297432) (← links)
- Efficient minus and signed domination in graphs (Q1399996) (← links)
- \(k\)-subdomination in graphs (Q1613364) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- On efficiently total dominatable digraphs (Q1714019) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
- An integer programming approach for solving a generalized version of the Grundy domination number (Q2032968) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
- Efficient domination in knights graphs (Q2370394) (← links)
- Generalized perfect domination in graphs (Q2444147) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q2948479) (← links)
- On the complexity of the labeled domination problem in graphs (Q2968509) (← links)
- Complexity of Total {k}-Domination and Related Problems (Q3004664) (← links)
- (Q3011738) (← links)
- A general method in the theory of domination in graphs (Q3066944) (← links)
- Algorithms and Complexity of Signed, Minus, and Majority Domination (Q3384120) (← links)
- Signed and Minus Dominating Functions in Graphs (Q3384612) (← links)
- Fractional Dominating Parameters (Q3384613) (← links)
- (Q3413877) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- From Italian domination in lexicographic product graphs to w-domination in graphs (Q5066972) (← links)
- A Taxonomy of Perfect Domination (Q5069690) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← links)
- Dominating functions with integer values in graphs—a survey (Q5456310) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5920175) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)
- On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)