The following pages link to Edge domination in graphs (Q1392425):
Displaying 22 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- Edge domination in some path and cycle related graphs (Q470539) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- On the line graph of the zero divisor graph for the ring of Gaussian integers modulo \(n\) (Q666536) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Complexity and characterization aspects of edge-related domination for graphs (Q2023127) (← links)
- Roman edge semi-total block domination of a graph (Q2422074) (← links)
- (Q4581873) (← links)
- The edge-to-edge geodetic domination number of a graph (Q5027740) (← links)
- RESTRAINED EDGE DOMINATION IN GRAPHS (Q5035971) (← links)
- Edge domination in Boolean function graph B(L(G), NINC) of a graph (Q5036688) (← links)
- On the domination number of a graph and its block graph (Q5057740) (← links)
- On coefficients of edge domination polynomial of a graph (Q5069790) (← links)
- RESTRAINED TOTAL EDGE DOMINATION IN THE JOIN OF GRAPHS (Q5075624) (← links)
- PERFECT EDGE DOMINATION IN GRAPHS (Q5076135) (← links)
- (Q5076568) (← links)
- DOMINATION AND EDGE DOMINATION IN TREES (Q5125259) (← links)
- EDGE DOMINATION AND TOTAL EDGE DOMINATION IN THE CORONA OF GRAPHS (Q5237551) (← links)
- Rainbow edge domination numbers in graphs (Q5243691) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
- (Q6185832) (← links)
- Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← links)
