Gossiping and routing in second-kind Frobenius graphs

DOI10.1016/J.EJC.2012.01.008MaRDI QIDQ427787zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Cayley graphFrobenius groupPaley graphs

Mathematics Subject Classification ID

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)

Recommendations

• FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
• Rotational circulant graphs
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• On 4-valent Frobenius circulant graphs
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes

Cites work

• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 1054728 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• scientific article; zbMATH DE number 3204712 (Why is no real title available?)
• scientific article; zbMATH DE number 3286093 (Why is no real title available?)
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• A Note on the Dimensionality of Modified Knödel Graphs
• A group-theoretic model for symmetric interconnection networks
• A survey of combinatorial optimization problems in multicast routing
• A survey of gossiping and broadcasting in communication networks
• A survey on Knödel graphs.
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
• Finding optimal routings in Hamming graphs
• Frobenius groups and classical maximal orders
• Gossiping and routing in undirected triple-loop networks
• Group Action Graphs and Parallel Architectures
• Hamiltonian circuits in Cayley graphs
• New gossips and telephones
• New methods for using Cayley graphs in interconnection networks
• On forwarding indices of networks
• On generalised Paley graphs and their automorphism groups
• On orbital regular graphs and Frobenius graphs
• On the minimum path problem in Knödel graphs
• Packet routing in fixed-connection networks: A survey
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• The Magma algebra system. I: The user language
• The edge-forwarding index or orbital regular graphs

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

Describes a project that uses

Uses Software

• Magma

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)