Pages that link to "Item:Q1108233"
From MaRDI portal
The following pages link to Dominating sets in social network graphs (Q1108233):
Displayed 17 items.
- Computing an effective decision making group of a society using social network analysis (Q489699) (← links)
- On rainbow domination numbers of graphs (Q497921) (← links)
- Bounds on the domination number and the metric dimension of co-normal product of graphs (Q824651) (← links)
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
- On the total Roman domination in trees (Q1717206) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Uncertain weighted dominating set: a prototype application on natural disaster relief management (Q1797772) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- Domination on hyperbolic graphs (Q2198410) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- New results on connected dominating structures in graphs (Q2283728) (← links)
- Independent rainbow domination of graphs (Q2421364) (← links)
- Near-Optimal Dominating Sets via Random Sampling (Q2830067) (← links)
- Semicomplete absorbent sets in digraphs (Q4956182) (← links)
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties (Q5074890) (← links)
- Dominating cliques in graphs (Q5896554) (← links)
- Dominating cliques in graphs (Q5925264) (← links)