Pages that link to "Item:Q881872"
From MaRDI portal
The following pages link to Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872):
Displaying 8 items.
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- On rainbow domination numbers of graphs (Q497921) (← links)
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs (Q621581) (← links)
- Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
- Counting the number of vertex covers in a trapezoid graph (Q990956) (← links)
- Independent rainbow domination of graphs (Q2421364) (← links)
- The hub number of co-comparability graphs (Q2514123) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)