An edge deleted unlabeled subgraph of a graph G is an ecard. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph G, dern(G), is the size of the smallest collection of da-ecards of G that uniquely determines G. The adversary degree associated edge reconstruction number of a graph G, adern(G), is the minimum number k such that every collection of k da-ecards of G uniquely determines G. A strong double broom is the graph on at least 5 vertices obtained from a union of (at least two) internally vertex disjoint paths with same ends u and v by appending leaves at u and v. In particular, B(n, n, mP k ) is the strong double broom with n leaves at both the ends u and v and with m internally vertex disjoint paths of order k joining u and v. We show that dern of strong double brooms is 1 or 2. We also determine adern(B(n, n, mP k )). It is 3 in most of the cases and 1 or 2 for all the remaining cases, except adern(B(1, 1, 2P k )) = 5 for k ≥ 4.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.