Girth of pancake graphs

DOI10.1016/j.dam.2011.06.013zbMath1228.05166OpenAlexW2021172574MaRDI QIDQ642997

Phillip E. C. Compeau

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

zbMATH Keywords

girthreversalsbreakpointspancake graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (14)

Component (edge) connectivity of pancake graphs ⋮ Neighbor-connectivity of pancake networks and burnt pancake networks ⋮ Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs ⋮ Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs ⋮ Lengths of cycles in generalized pancake graphs ⋮ Paired 2-disjoint path covers of burnt pancake graphs with faulty elements ⋮ Target set selection on generalized pancake graphs ⋮ Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract) ⋮ Cycles in the burnt pancake graph ⋮ Some relations on prefix reversal generators of the symmetric and hyperoctahedral group ⋮ The extra connectivity and extra diagnosability of regular interconnection networks ⋮ Relationship between extra edge connectivity and component edge connectivity for regular graphs ⋮ Neighbor connectivity of pancake graphs and burnt pancake graphs ⋮ Fault tolerance and diagnosability of burnt pancake networks under the comparison model

Cites Work

• Unnamed Item
• Unnamed Item
• On the embedding of cycles in pancake graphs
• An \((18/11)n\) upper bound for sorting by prefix reversals
• Bounds for sorting by prefix reversal
• On the problem of sorting burnt pancakes
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Transforming cabbage into turnip
• Sorting by Transpositions

This page was built for publication: Girth of pancake graphs