Symmetries and sense of direction in labeled graphs

DOI10.1016/S0166-218X(98)00051-1zbMath0917.05068WikidataQ127613968 ScholiaQ127613968MaRDI QIDQ1270775

Nicola Santoro, Alessandro Roncato, Paola Flocchini

Publication date: 3 November 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

distributed systemscharacterizationCayley graphssense of directionedge-labeled graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

Computing on anonymous networks with sense of direction ⋮ Weak sense of direction labelings and graph embeddings ⋮ Lower bounds for weak sense of direction ⋮ Sense of direction in distributed computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the impact of sense of direction on message complexity
• Minimal sense of direction in regular networks
• Minimal sense of direction and decision problems for Cayley graphs
• Towards optimal distributed election on chordal rings
• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• Computing on anonymous networks with sense of direction
• Computing on an anonymous ring
• Sense of direction: Definitions, properties, and classes
• Computing functions on asynchronous anonymous networks
• Efficient leader election using sense of direction
• TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION

This page was built for publication: Symmetries and sense of direction in labeled graphs