Pages that link to "Item:Q456886"
From MaRDI portal
The following pages link to Upper bounds on the broadcast function using minimum dominating sets (Q456886):
Displayed 15 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Tight lower bounds on broadcast function for \(n = 24\) and 25 (Q401149) (← links)
- Efficient broadcast trees for weighted vertices (Q516786) (← links)
- The shortest path problem in the Knödel graph (Q2018539) (← links)
- The complexity of finding a broadcast center (Q2151362) (← links)
- A new construction of broadcast graphs (Q2181251) (← links)
- Efficient construction of broadcast graphs (Q2449099) (← links)
- Diametral broadcast graphs (Q2449105) (← links)
- A New Construction of Broadcast Graphs (Q2795946) (← links)
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs (Q2971647) (← links)
- Total domination in cubic Knodel graphs (Q4957563) (← links)
- (Q5197581) (← links)
- Domination in Kn\"odel Graphs (Q6041432) (← links)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
- Diameter of General Knödel Graphs (Q6145626) (← links)