Pages that link to "Item:Q3400884"
From MaRDI portal
The following pages link to An Efficient Vertex Addition Method for Broadcast Networks (Q3400884):
Displaying 13 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)
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- The shortest path problem in the Knödel graph (Q2018539) (← 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)
- On equitable colouring of Knödel graphs (Q2935368) (← links)
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs (Q2971647) (← links)
- Total domination in cubic Knodel graphs (Q4957563) (← links)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
- On broadcast schemes of Knödel graphs (Q6656780) (← links)
