A note on the adversary degree associated reconstruction number of graphs

DOI10.1155/2013/808105zbMath1295.05158OpenAlexW2009430911WikidataQ58920148 ScholiaQ58920148MaRDI QIDQ2249937

Yanyan Li

Publication date: 4 July 2014

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

Full work available at URL: https://doi.org/10.1155/2013/808105

zbMATH Keywords

complete bipartite graphswheelsdacards

Mathematics Subject Classification ID

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

Related Items (3)

The adversary degree-associated reconstruction number of double-brooms ⋮ Graphs with arbitrarily large adversary degree associated reconstruction number ⋮ Adversary degree associated reconstruction number of graphs

Cites Work

• Degree-associated reconstruction number of graphs
• The graph reconstruction number
• The falsity of the reconstruction conjecture for tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the adversary degree associated reconstruction number of graphs