Embedding Wheel - like Networks
From MaRDI portal
Publication:6187747
DOI10.61186/ijmsi.18.2.185arXiv1902.03391OpenAlexW4388162832MaRDI QIDQ6187747
Sudeep Stephen, R. Sundara Rajan, A. Arul Shantrinal, K. Jagadeesh Kumar, T. M. Rajalaxmi
Publication date: 15 January 2024
Published in: Iranian Journal of Mathematical Sciences and Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.03391
Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal 1-Hamiltonian graphs
- Paths and cycles embedding on faulty enhanced hypercube networks
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Embedding of hypercubes into necklace, windmill and snake graphs
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
- Cycles embedding in folded hypercubes with conditionally faulty vertices
- Embedding of tori and grids into twisted cubes
- Embedding meshes/tori in faulty crossed cubes
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Embedding of cycles in twisted cubes with edge-pancyclic
- Embedding of meshes in Möbius cubes
- Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs
- Embedding meshes into locally twisted cubes
- Exact wirelength of hypercubes on a grid
- Survey on path and cycle embedding in some networks
- Asymptotics of the average number of nondominant options of binary relations
- Arrangement graphs: A class of generalized star graphs
- The cyclic cutwidth of trees
- On some super fault-tolerant Hamiltonian graphs
- Wirelength of hypercubes into certain trees
- Locally twisted cubes are 4-pancyclic.
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- The congestion of \(n\)-cube layout on a rectangular grid
- Wirelength of embedding complete multipartite graphs into certain graphs
- Embedding meshes into crossed cubes
- Hyper-Hamiltonian generalized Petersen graphs
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
- On embedding rectangular grids in hypercubes
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- The Mobius cubes
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- Embedding of cycles and wheels into arbitrary trees
- Augmented cubes
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
- Efficient embeddings of grids into grids
- Optimal embeddings of generalized ladders into hypercubes
