Decycling hypercubes

DOI10.1007/S00373-003-0529-9MaRDI QIDQ1423502zbMATH OpenOpenAlexFDO

Authors David A. Pike

Publication date 4 March 2004

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-003-0529-9

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Decycling \(d\)-ary \(n\)-dimensional cubes
• Decycling cubes and grids
• Decycling of Fibonacci cubes
• Cyclic compositions and cycles of the hypercube
• Cycles in folded hypercubes
• Sphere decompositions of hypercubes
• On recursively directed hypercubes
• Cycles embedding in exchanged hypercubes
• scientific article; zbMATH DE number 3557813
• Recursive circulants and their embeddings among hypercubes

Cited in

(19)

• Minimum feedback vertex sets in shuffle-based interconnection networks
• On the acyclic point-connectivity of the n-cube
• Decycling cubes and grids
• The decycling number of P_m P^_n
• Cyclic-cubes and wrap-around butterflies
• Feedback vertex number of Sierpiński-type graphs
• Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs
• Decycling graphs
• New bounds on the decycling number of generalized de Bruijn digraphs
• On the decycling number of generalized Kautz digraphs
• The k-conversion number of regular graphs
• Cycle intersection graphs and minimum decycling sets of even graphs
• Decycling bipartite graphs
• Decycling \(d\)-ary \(n\)-dimensional cubes
• A lower bound on the \(k\)-conversion number of graphs of maximum degree \(k+1\)
• Subgraph-avoiding minimum decycling sets and \(k\)-conversion sets in graphs
• Error correcting codes arising from cubes
• Decycling of Fibonacci cubes
• Induced forests in some distance-regular graphs

This page was built for publication: Decycling hypercubes

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