2 results for "P. Anusha Devi"
Showing 1–2 · 0.28 seconds · RSS
-
Journal Article
Graphs with arbitrarily large adversary degree associated reconstruction number
A vertex deleted unlabeled subgraph of a graph is a card. A dacard specifies the degree of the deleted vertex along with the card. The adversary degree associated reconstruction number of a graph G, denoted is the minimum number k such that every collection of k dacards of G uniquely determines G…
-
Journal Article
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
An ecard of a graph $G$ is a subgraph formed by deleting an edge. 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 minimum number of da-ecards that uniquely determines $G.$ The adversary degree…