The adversary degree-associated reconstruction number of double-brooms

DOI10.1016/J.JDA.2015.03.008MaRDI QIDQ491632zbMATH OpenOpenAlexFDO

Authors Meijie Ma, Huangping Shi, Douglas B. West

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

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

Recommendations

• Graphs with arbitrarily large adversary degree associated reconstruction number
• Degree-associated edge-reconstruction numbers of double-brooms
• A note on the adversary degree associated reconstruction number of graphs
• Adversary degree associated reconstruction number of graphs
• Adversary degree associated reconstruction number of graphs obtained from complete graphs or cycles

Cites work

• A congruence theorem for trees
• A note on the adversary degree associated reconstruction number of graphs
• Adversary degree associated reconstruction number of graphs
• Adversary degree associated reconstruction number of graphs obtained from complete graphs or cycles
• Almost every graph has reconstruction number three
• Degree associated edge reconstruction number of graphs
• Degree-associated reconstruction number of graphs
• Families of pairs of graphs with a large number of common cards
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3544095 (Why is no real title available?)
• On reconstruction of graphs
• The graph reconstruction number

Cited in

(8)

• A note on the adversary degree associated reconstruction number of graphs
• Degree-associated edge-reconstruction numbers of double-brooms
• 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
• Adversary degree associated reconstruction number of graphs
• Adversary degree associated reconstruction number of graphs obtained from complete graphs or cycles
• Degree associated edge reconstruction parameters of strong double brooms

This page was built for publication: The adversary degree-associated reconstruction number of double-brooms

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