Pages that link to "Item:Q3208702"
From MaRDI portal
The following pages link to Graph-theoretic parameters concerning domination, independence, and irredundance (Q3208702):
Displayed 17 items.
- 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)