Gossiping and routing in second-kind Frobenius graphs
From MaRDI portal
Publication:427787
DOI10.1016/j.ejc.2012.01.008zbMath1244.05113OpenAlexW2067213979MaRDI QIDQ427787
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
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Series expansions of functions of one complex variable (30B99)
Related Items
Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd, Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes, Recursive cubes of rings as models for interconnection networks, Rotational circulant graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalised Paley graphs and their automorphism groups
- Hamiltonian circuits in Cayley graphs
- New methods for using Cayley graphs in interconnection networks
- New gossips and telephones
- Packet routing in fixed-connection networks: A survey
- The edge-forwarding index or orbital regular graphs
- The Magma algebra system. I: The user language
- On orbital regular graphs and Frobenius graphs
- A survey on Knödel graphs.
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- On forwarding indices of networks
- Finding optimal routings in Hamming graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- A survey of combinatorial optimization problems in multicast routing
- Frobenius groups and classical maximal orders
- Gossiping and routing in undirected triple-loop networks
- Group Action Graphs and Parallel Architectures
- A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
- On the minimum path problem in Knödel graphs
- A survey of gossiping and broadcasting in communication networks
- A group-theoretic model for symmetric interconnection networks
- A Note on the Dimensionality of Modified Knödel Graphs
- FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR