Minimal sense of direction in regular networks

DOI10.1016/S0020-0190(97)00031-8zbMath1337.68203MaRDI QIDQ290224

Paola Flocchini

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Cayley graphsdistributed computinggraph labelingssense of direction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Minimal sense of direction and decision problems for Cayley graphs ⋮ Weak sense of direction labelings and graph embeddings ⋮ Symmetries and sense of direction in labeled graphs ⋮ TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION ⋮ Coverings that preserve sense of direction ⋮ Sense of direction in distributed computing

Cites Work

• Hamiltonian decomposition of Cayley graphs of degree 4
• Towards optimal distributed election on chordal rings
• New methods for using Cayley graphs in interconnection networks
• Processor interconnection networks from Cayley graphs
• Efficient elections in chordal ring networks
• Labeled versus unlabeled distributed Cayley networks
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Uniform self-stabilizing ring orientation
• Computing on an anonymous ring
• A group-theoretic model for symmetric interconnection networks
• An improved election algorithm in chordal ring networks
• Network Orientation
• Distributed computing on transitive networks: The torus

This page was built for publication: Minimal sense of direction in regular networks