Node bisectors of Cayley graphs

DOI10.1007/BF01301966MaRDI QIDQ4717053zbMATH OpenOpenAlexFDO

Authors Simon R. Blackburn

Publication date 1 December 1996

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01301966

zbMATH Keywords

Cayley graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the diameter and bisector size of Cayley graphs
• On small cuts separating an abelian Cayley graph into two equal parts
• scientific article; zbMATH DE number 1759403
• Large Cayley graphs on an abelian group

Cites work

• A group-theoretic model for symmetric interconnection networks
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• On the diameter and bisector size of Cayley graphs
• On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing

Cited in

(3)

• scientific article; zbMATH DE number 1759403 (Why is no real title available?)
• Random walks, bisections and gossiping in circulant graphs
• On small cuts separating an abelian Cayley graph into two equal parts

This page was built for publication: Node bisectors of Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717053)