Pages that link to "Item:Q2492229"
From MaRDI portal
The following pages link to Two classes of edge domination in graphs (Q2492229):
Displaying 22 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- On the mixed minus domination in graphs (Q384196) (← links)
- Upper signed \(k\)-domination in a general graph (Q765509) (← links)
- A note on the signed edge domination number in graphs (Q948701) (← links)
- Signed star domatic number of a graph (Q968131) (← links)
- A comment to: Two classes of edge domination in graphs (Q1003688) (← links)
- Signed Stark-subdomination numbers in graphs (Q1005254) (← links)
- On the signed edge domination number of graphs (Q1011499) (← 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)
- Upper bounds on the signed edge domination number of a graph (Q2214050) (← links)
- Maximal matching and edge domination in complete multipartite graphs (Q2921894) (← links)
- On the complexity of variations of mixed domination on graphs<sup>†</sup> (Q2958268) (← links)
- THE SIGNED STAR DOMINATION NUMBER OF CAYLEY GRAPHS (Q3166728) (← links)
- Signed star (k,k)-domatic number of a graph (Q3458979) (← links)
- On the balanced domination of graphs (Q5016065) (← links)
- Signed star (j, k)-domatic numbers of digraphs (Q5261040) (← links)
- Dominating functions with integer values in graphs—a survey (Q5456310) (← links)
- Signed Roman edge domination numbers in graphs (Q5963625) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
- (Q6039746) (← links)
- Algorithms and hardness results for edge total domination problem in graphs (Q6199394) (← links)
