Graphs with arbitrarily large adversary degree associated reconstruction number

DOI10.1016/j.akcej.2019.12.022zbMath1468.05185OpenAlexW3027439994MaRDI QIDQ4956225

P. Anusha Devi, S. Monikandan

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.12.022

zbMATH Keywords

reconstructiondacardreconstruction number

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree associated edge reconstruction number of graphs
• The adversary degree-associated reconstruction number of double-brooms
• Degree-associated reconstruction parameters of complete multipartite graphs and their complements
• Degree-associated reconstruction number of graphs
• On a new digraph reconstruction conjecture
• A note on the adversary degree associated reconstruction number of graphs
• The graph reconstruction number
• The falsity of the reconstruction conjecture for tournaments
• Adversary degree associated reconstruction number of graphs

This page was built for publication: Graphs with arbitrarily large adversary degree associated reconstruction number