Girth of pancake graphs
From MaRDI portal
Publication:642997
DOI10.1016/J.DAM.2011.06.013zbMATH Open1228.05166OpenAlexW2021172574MaRDI QIDQ642997FDOQ642997
Publication date: 27 October 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.013
Recommendations
Cites Work
- On the embedding of cycles in pancake graphs
- Title not available (Why is that?)
- Bounds for sorting by prefix reversal
- Title not available (Why is that?)
- Sorting by Transpositions
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Transforming cabbage into turnip
- On the problem of sorting burnt pancakes
- An \((18/11)n\) upper bound for sorting by prefix reversals
Cited In (16)
- Paired 2-disjoint path covers of burnt pancake graphs with faulty elements
- Component (edge) connectivity of pancake graphs
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- Some relations on prefix reversal generators of the symmetric and hyperoctahedral group
- Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
- Cycles in the burnt pancake graph
- The extra connectivity and extra diagnosability of regular interconnection networks
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- Neighbor-connectivity of pancake networks and burnt pancake networks
- Lengths of cycles in generalized pancake graphs
- The structure fault tolerance of burnt pancake networks
- The generalized 4-connectivity of burnt pancake graphs
- Relationship between extra edge connectivity and component edge connectivity for regular graphs
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
- Target set selection on generalized pancake graphs
- Neighbor connectivity of pancake graphs and burnt pancake graphs
This page was built for publication: Girth of pancake graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642997)