Pages that link to "Item:Q2764998"
From MaRDI portal
The following pages link to Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs (Q2764998):
Displaying 19 items.
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- Odd gossiping (Q516782) (← links)
- A survey on Knödel graphs. (Q1427198) (← links)
- On the structure of minimum broadcast digraphs (Q1575743) (← links)
- Hierarchical broadcast and gossip networks (Q1607034) (← links)
- Broadcasting multiple messages in the 1-in port model in optimal time (Q1631684) (← links)
- Optimal odd gossiping (Q1671312) (← links)
- The epistemic gossip problem (Q1712508) (← links)
- Domination in 4-regular Knödel graphs (Q1738162) (← links)
- Faster gossiping on butterfly networks (Q1770425) (← links)
- Sparse hypercube -- a minimal \(k\)-line broadcast graph. (Q1811066) (← links)
- The shortest path problem in the Knödel graph (Q2018539) (← links)
- On equitable colouring of Knödel graphs (Q2935368) (← links)
- Total domination in cubic Knodel graphs (Q4957563) (← links)
- New bounds on the minimum number of calls in failure‐tolerant gossiping (Q5191126) (← links)
- Some minimum gossip graphs (Q5289378) (← links)
- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength (Q6132556) (← links)
- Diameter of General Knödel Graphs (Q6145626) (← links)
- 2-power domination number for Knödel graphs and its application in communication networks (Q6181254) (← links)
