Lexicographic products with high reconstruction numbers

DOI10.1016/j.disc.2012.02.004zbMath1242.05182OpenAlexW2019579600MaRDI QIDQ418863

Chester Lipka, Geňa Hahn, Stacey Wynn Lamont, Richard C. Brewster

Publication date: 30 May 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.02.004

zbMATH Keywords

graphautomorphism groupcompositionreconstructionlexicographic product

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Set recognition of decomposable graphs and steps towards their reconstruction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• The composition of graphs
• Almost every graph has reconstruction number three
• Families of pairs of graphs with a large number of common cards
• The graph reconstruction number
• The lexicographic product of graphs

This page was built for publication: Lexicographic products with high reconstruction numbers