Edge reconstruction and the swapping number of a graph

MaRDI QIDQ2875477zbMATH OpenFDO

Authors Dalibor Fronček, Amy Hlavacek, Steven J. Rosenberg

Publication date 15 August 2014

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://ajc.maths.uq.edu.au/pdf/58/ajc_v58_p001.pdf

zbMATH Keywords

unicyclic graphsgraph automorphism1-swappable trees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7604997
• 2-swappable graphs
• Graph reconstruction -- some new developments
• On the edge-reconstruction number of a tree
• Switching reconstruction and diophantine equations

Cited in

(5)

• scientific article; zbMATH DE number 7604997 (Why is no real title available?)
• 2-swappable graphs
• A matroid view of key theorems for edge-swapping algorithms
• scientific article; zbMATH DE number 5077152 (Why is no real title available?)
• Graphs isomorphisms under edge-replacements and the family of amoebas

This page was built for publication: Edge reconstruction and the swapping number of a graph

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