Edge reconstruction and the swapping number of a graph

zbMATH Open1296.05133MaRDI QIDQ2875477FDOQ2875477

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

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

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)

Cited In (5)

• Title not available (Why is that?)
• Graphs isomorphisms under edge-replacements and the family of amoebas
• A matroid view of key theorems for edge-swapping algorithms
• Title not available (Why is that?)
• 2-swappable graphs

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)