Pages that link to "Item:Q1916125"
From MaRDI portal
The following pages link to Lower bounds for the size in four families of minimum broadcast graphs (Q1916125):
Displaying 19 items.
- Tight lower bounds on broadcast function for \(n = 24\) and 25 (Q401149) (← links)
- On the number of broadcast schemes in networks (Q845865) (← links)
- Broadcasting from multiple originators (Q967331) (← links)
- Extremal broadcasting problems (Q1120554) (← links)
- Compound constructions of broadcast networks (Q1296577) (← links)
- Some minimum broadcast graphs (Q1339895) (← links)
- On the structure of minimum broadcast digraphs (Q1575743) (← links)
- The broadcast function value \(B(23)\) is \(33\) or \(34\). (Q1582579) (← links)
- Improved lower bound on broadcast function based on graph partition (Q1642698) (← links)
- A 1-relaxed minimum broadcast graph on 15 vertices. (Q1764502) (← links)
- Lower bounds for the size in four families of minimum broadcast graphs (Q1916125) (← links)
- More broadcast graphs (Q1961235) (← links)
- A new construction of broadcast graphs (Q2181251) (← links)
- The multiple originator broadcasting problem in graphs (Q2370417) (← links)
- Efficient construction of broadcast graphs (Q2449099) (← links)
- Improved upper and lower bounds for \(k\)-broadcasting (Q2714909) (← links)
- A New Construction of Broadcast Graphs (Q2795946) (← links)
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs (Q2971647) (← links)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
