Degree Associated Reconstruction Parameters of Total Graphs

P. Anusha Devi, S. Monikandan

Abstract


A card (ecard) of a graph G is a subgraph formed by deleting a vertex (an edge). A dacard (da-ecard) specifies the degree of the deleted vertex (edge) along with the card (ecard). The degree associated reconstruction number (degree associated edge reconstruction number ) of a graph G, drn(G) (dern(G)), is the minimum number of dacards (da-ecards) that uniquely determines G. In this paper, we investigate these two parameters for the total graph of certain standard graphs.

Keywords


reconstruction number, degree associated reconstruction number, degree associated edge reconstruction number

Full Text:

PDF

References


M.D. Barrus and D.B. West, Degree-associated reconstruction number of graphs, Discrete Math. 310 (2010) 2600-2612.

David W. Bange, Anthony E. Barkauskas and Linda H. Host, Class-reconstrucion of total graphs, J. Graph Theory, Vol. 11, No.2 (1987) 221-230.

F. Harary, Graph Theory, Addison Wesley, Mass. 1969.

F. Harary and M. Plantholt, The graph reconstruction number, J. Graph Theory 9 (1985) 451- 454.

S. Monikandan and S. Sundar Raj, Degree associated edge reconstruction number, Combinatorial algorithms, Lecture Notes in Computer Science 7643, Springer-Verlag, Berlin (2012) 100-109.

S. Monikandan, P. Anusha Devi and S. Sundar Raj, Degree associated edge reconstruction number of graphs, Journal of Discrete Algorithms 23 (2013) 35-41.

S. Monikandan and S. Sundar Raj, Adversary Degree Associated Reconstruction Number of Graphs, Discrete Mathematics, Algorithms and Applications, (revised).

S. Ramachandran, Degree associated reconstruction number of graphs and digraphs, Mano. Int. J. Mathematical Sciences 1 (2000) 41-53.

S. Ramachandran, The reconstruction number for Ulam’s Conjecture, Ars Combin. 78 (2006) 289-296.


Comments on this article

View all comments


Contributions to Discrete Mathematics. ISSN: 1715-0868