Embedding of cycles and wheels into arbitrary trees
From MaRDI portal
Publication:4651924
DOI10.1002/net.20027zbMath1056.05042OpenAlexW2067883446MaRDI QIDQ4651924
Paul D. Manuel, Albert William, Jasintha Quadras, Indra Rajasingh
Publication date: 23 February 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20027
Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (19)
Embedding complete multi-partite graphs into Cartesian product of paths and cycles ⋮ Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees ⋮ Embeddings of circulant networks ⋮ Wirelength of embedding complete multipartite graphs into certain graphs ⋮ Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees ⋮ Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength ⋮ Minimum average congestion of enhanced and augmented hypercubes into complete binary trees ⋮ Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans ⋮ Embedding Wheel - like Networks ⋮ Embedding of hypercubes into necklace, windmill and snake graphs ⋮ On the optimal layout of balanced complete multipartite graphs into grids and tree related structures ⋮ Embedding of hypercubes into sibling trees ⋮ Wiener Index of Hypertree ⋮ Bothway embedding of circulant network into grid ⋮ Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees ⋮ Wirelength of hypercubes into certain trees ⋮ Maximum incomplete recursive circulants in graph embeddings ⋮ Embedding of recursive circulants into certain necklace graphs ⋮ Exact wirelength of hypercubes on a grid
Cites Work
This page was built for publication: Embedding of cycles and wheels into arbitrary trees
