On Some Structural Properties of Star and Pancake Graphs
DOI10.1007/978-3-642-36899-8_23zbMath1377.05159OpenAlexW100280413MaRDI QIDQ4915252
Publication date: 9 April 2013
Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_23
Cayley graphstar graphefficient dominating setperfect codecycle embeddingpancake graphstar networkpancake network
Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On average and highest number of flips in pancake sorting
- On the embedding of cycles in pancake graphs
- Bounds for sorting by prefix reversal
- Efficient dominating sets in Cayley graphs.
- Chromatic properties of the Pancake graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Small cycles in the Pancake graph
- A group-theoretic model for symmetric interconnection networks
- On the Diameter of the Pancake Network
This page was built for publication: On Some Structural Properties of Star and Pancake Graphs