The adversary degree-associated reconstruction number of double-brooms

DOI10.1016/j.jda.2015.03.008zbMath1337.05102OpenAlexW1999575245MaRDI QIDQ491632

Douglas B. West, Huangping Shi, Meijie Ma

Publication date: 18 August 2015

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

Full work available at URL: https://doi.org/10.1016/j.jda.2015.03.008

zbMATH Keywords

adversary reconstructiondegree-associated reconstructiondouble-broom

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items

Unnamed Item ⋮ Graphs with arbitrarily large adversary degree associated reconstruction number ⋮ Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph ⋮ Degree associated edge reconstruction number of split graphs with biregular independent set is one

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree associated edge reconstruction number of graphs
• Degree-associated reconstruction number of graphs
• A congruence theorem for trees
• A note on the adversary degree associated reconstruction number of graphs
• Almost every graph has reconstruction number three
• Families of pairs of graphs with a large number of common cards
• The graph reconstruction number
• Adversary degree associated reconstruction number of graphs
• On reconstruction of graphs