Path bipancyclicity of hypercubes

DOI10.1016/J.IPL.2006.08.011zbMATH Open1185.68052OpenAlexW2074331047MaRDI QIDQ845903FDOQ845903

Authors: Chang-Hsiung Tsai, Shu-Yun Jiang 

Publication date: 29 January 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.08.011

Recommendations

• Hamiltonian paths and cycles passing through a prescribed path in hypercubes
• On path bipancyclicity of hypercubes
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• On the bipanpositionable bipanconnectedness of hypercubes
• The bipanpositionable bipancyclic property of the hypercube

zbMATH Keywords

hypercubeHamiltonianinterconnection networksedge-bipancyclicpath-bipancyclicvertex-bipancyclic

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cites Work

• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Title not available (Why is that?)
• Linear array and ring embeddings in conditional faulty hypercubes
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Title not available (Why is that?)

Cited In (32)

• Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
• Paths in \([ h , k ]\)-bipartite hypertournaments
• Efficient unicast in bijective connection networks with the restricted faulty node set
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• Finding cycles in hierarchical hypercube networks
• Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
• Two node-disjoint paths in balanced hypercubes
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Survey on path and cycle embedding in some networks
• Hamiltonian laceability of hypercubes with prescribed linear forest and/or faulty edges
• Mutually independent bipanconnected property of hypercube
• On paths and cycles dominating hypercubes
• Cycles passing through a prescribed path in a hypercube with faulty edges
• Cycles embedding in exchanged crossed cube
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• On path bipancyclicity of hypercubes
• Hamiltonian paths and cycles passing through a prescribed path in hypercubes
• Cycles and paths embedded in varietal hypercubes
• The path-distance-width of hypercubes
• Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
• Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
• The bipanpositionable bipancyclic property of the hypercube
• Vertex-bipancyclicity of the generalized honeycomb tori
• The bicube: an interconnection of two hypercubes
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• The bipancycle-connectivity of the hypercube
• The 2-path-bipanconnectivity of hypercubes
• On 3-regular bipancyclic subgraphs of hypercubes
• The weakly dimension-balanced pancyclicity on toroidal mesh graph \(T_{m,n}\) When both \(m\) and \(n\) are odd
• On the bipanpositionable bipanconnectedness of hypercubes
• A note on path bipancyclicity of hypercubes
• Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes

This page was built for publication: Path bipancyclicity of hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845903)