The following pages link to (Q3140345):
Displayed 22 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- On the complexity of the bondage and reinforcement problems (Q413470) (← links)
- The total bondage number of grid graphs (Q714029) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Some progress on total bondage in graphs (Q2014725) (← links)
- The complexity of total edge domination and some related results on trees (Q2023114) (← links)
- Complexity and characterization aspects of edge-related domination for graphs (Q2023127) (← links)
- The total bondage numbers and efficient total dominations of vertex-transitive graphs (Q2333221) (← links)
- Signed total Roman edge domination in graphs (Q2409794) (← links)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764) (← links)
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs (Q2468904) (← links)
- Domination parameters in coronene torus network (Q2516501) (← links)
- Complexity and bounds for disjunctive total bondage (Q2661777) (← links)
- Maximal matching and edge domination in complete multipartite graphs (Q2921894) (← links)
- The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs (Q3467878) (← links)
- Correlation of domination parameters with physicochemical properties of octane isomers (Q4597658) (← links)
- Introduction to dominated edge chromatic number of a graph (Q5004071) (← links)
- Bounds on total edge domination number of a tree (Q5012811) (← links)
- (Q5038382) (← links)
- The k-power bondage number of a graph (Q5298349) (← links)
- Algorithms and hardness results for edge total domination problem in graphs (Q6199394) (← links)
- Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← links)