Gossiping and routing in second-kind Frobenius graphs
DOI10.1016/J.EJC.2012.01.008zbMATH Open1244.05113OpenAlexW2067213979MaRDI QIDQ427787FDOQ427787
Authors: Xin Gui Fang, Sanming Zhou 
Publication date: 18 June 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.01.008
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Network design and communication in computer systems (68M10) Series expansions of functions of one complex variable (30B99)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Gossiping and routing in undirected triple-loop networks
- A survey of gossiping and broadcasting in communication networks
- A group-theoretic model for symmetric interconnection networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New methods for using Cayley graphs in interconnection networks
- Group Action Graphs and Parallel Architectures
- Title not available (Why is that?)
- A survey of combinatorial optimization problems in multicast routing
- A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
- On generalised Paley graphs and their automorphism groups
- Hamiltonian circuits in Cayley graphs
- Packet routing in fixed-connection networks: A survey
- New gossips and telephones
- The edge-forwarding index or orbital regular graphs
- On orbital regular graphs and Frobenius graphs
- A survey on Knödel graphs.
- On forwarding indices of networks
- Finding optimal routings in Hamming graphs
- Frobenius groups and classical maximal orders
- On the minimum path problem in Knödel graphs
- A Note on the Dimensionality of Modified Knödel Graphs
- FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
Cited In (9)
- FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
- Rotational circulant graphs
- Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
- Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
- On the edge-forwarding indices of Frobenius graphs
- Gossiping and routing in undirected triple-loop networks
- On 4-valent Frobenius circulant graphs
- The relationship between gossiping in vertex-disjoint paths mode and bisection width
- Recursive cubes of rings as models for interconnection networks
Uses Software
This page was built for publication: Gossiping and routing in second-kind Frobenius graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427787)
