Pages that link to "Item:Q3208702"
From MaRDI portal
The following pages link to Graph-theoretic parameters concerning domination, independence, and irredundance (Q3208702):
Displaying 38 items.
- Matching edges and faces in polygonal partitions (Q2462737) (← links)
- On graphs with equal domination and 2-domination numbers (Q2483412) (← links)
- On matching and total domination in graphs (Q2483421) (← links)
- A note on acyclic domination number in graphs of diameter two (Q2492203) (← links)
- On automorphism groups of circulant digraphs of square-free order (Q2568476) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- Dominating sets inducing large components (Q2629281) (← links)
- On well-dominated graphs (Q2657074) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- Irredundance (Q3384112) (← links)
- Models of Domination in Graphs (Q3384605) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Private domination number of a graph (Q3545836) (← links)
- The ratio of the distance irredundance and domination numbers of a graph (Q4277983) (← links)
- MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS (Q4288050) (← links)
- (Q4506068) (← links)
- Inequalities involving independence domination, f-domination, connected and total f-domination numbers (Q4814435) (← links)
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (Q4820130) (← links)
- EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS (Q4886301) (← links)
- (Q5006578) (← links)
- Graphs with equal domination and independent domination numbers (Q5012363) (← links)
- Total vertex-edge domination (Q5028563) (← links)
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs (Q5090153) (← links)
- An algorithm to check the equality of total domination number and double of domination number in graphs (Q5099751) (← links)
- 1-Triangle graphs and perfect neighborhood sets (Q5269160) (← links)
- Relating ordinary and total domination in cubic graphs of large girth (Q5419942) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)
- Enumeration and maximum number of maximal irredundant sets for chordal graphs (Q5919544) (← links)
- Alignment networks and electrical networks (Q5961631) (← links)
- A Roman domination chain (Q5964976) (← links)
- Computational complexity aspects of super domination (Q6076353) (← links)
- Partial domination in supercubic graphs (Q6080128) (← links)
- Partial domination and irredundance numbers in graphs (Q6096253) (← links)
- A characterization of well-dominated Cartesian products (Q6124450) (← links)
- A note on the \(P_3\)-isolation number of a graph (Q6658909) (← links)
