Hamiltonian properties on a class of circulant interconnection networks
From MaRDI portal
Publication:5012825
DOI10.2298/FIL1801071BzbMath1488.05286MaRDI QIDQ5012825
Publication date: 25 November 2021
Published in: Filomat (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- Unnamed Item
- Which weighted circulant networks have perfect state transfer?
- On the generalized twisted cube
- Long paths and cycles in hypercubes with faulty vertices
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Integral Cayley graphs over Abelian groups
- Long paths in hypercubes with conditional node-faults
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Recursive circulants and their embeddings among hypercubes
- Pancyclicity of recursive circulant graphs
- Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges
- A survey on multi-loop networks.
- Embedding trees in recursive circulants
- Some properties of unitary Cayley graphs
- On the energy of unitary Cayley graphs
- Hamiltonian properties on the class of hypercube-like networks
- On the average energy of circulant graphs
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS
This page was built for publication: Hamiltonian properties on a class of circulant interconnection networks
