Symmetry properties of chordal rings of degree 3
From MaRDI portal
Publication:1406021
DOI10.1016/S0166-218X(02)00569-3zbMath1026.05097MaRDI QIDQ1406021
Publication date: 9 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT, Equalising the transmission properties of graph-modelled networks by introducing the control of the resources used to transmit information
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chordal rings as fault-tolerant loops
- A note on Adam's conjecture
- Efficient elections in chordal ring networks
- Compact routing on chordal rings of degree 4
- A note on isomorphic chordal rings
- Recognizing circulant graphs of prime order in polynomial time
- On forwarding indices of networks
- On isomorphisms of finite Cayley graphs---a survey
- NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS
- On a Class of Fixed-Point-Free Graphs
- Reliabilities of chordal rings
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Survival reliability of some double-loop networks and chordal rings
- Fault-tolerant routings in chordal ring networks
- Self-dual configurations and regular graphs