Lexicographic products with high reconstruction numbers

DOI10.1016/J.DISC.2012.02.004MaRDI QIDQ418863zbMATH OpenOpenAlexFDO

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

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

automorphism groupcompositiongraphlexicographic productreconstruction

Mathematics Subject Classification ID

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

Recommendations

• Lexicographic products and a conjecture of Hahn and Jackson
• scientific article; zbMATH DE number 1145715
• On the pancyclicity of lexicographic products
• Representable lexicographic products
• Characterization of the hyperbolicity in the lexicographic product
• Lexicographic product and isoperimetric number
• Rees products and lexicographic shellability
• Infinite lexicographic products
• Sequential properties of lexicographic products
• Lexicographic product of digraphs and related boundary-type sets

Cites work

• A congruence theorem for trees
• Almost every graph has reconstruction number three
• Families of pairs of graphs with a large number of common cards
• Graph reconstruction numbers
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 4154485 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 1051281 (Why is no real title available?)
• scientific article; zbMATH DE number 1478125 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3311628 (Why is no real title available?)
• scientific article; zbMATH DE number 2222767 (Why is no real title available?)
• The composition of graphs
• The graph reconstruction number
• The lexicographic product of graphs

Cited in

(6)

• Representable lexicographic products
• The weight of lexicographic products
• Set recognition of decomposable graphs and steps towards their reconstruction
• The pre-hull number and lexicographic product
• The reconstruction number of a lexicographic sum of cliques
• On the reconstruction number of generalized join of graphs

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

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