https://archives.christuniversity.in/files/original/a8a319b6ac5dd340e6295685f4814a41.pdf c7eef0e507e175ee728e65f8e12a4c8d Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource MPHIL Mphil Mphil Thesis Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource On Degree Sequence of Total Graphs and the Order of the Graphs Creator An entity primarily responsible for making the resource Thomas Jijo Date A point or period of time associated with an event in the lifecycle of the resource 2012 Source A related resource from which the described resource is derived Mathematics Description An account of the resource In this dissertation we discuss about the degree sequence of total graphs of some general graphs. A total graph of G, denoted by T(G) has vertex set as the union of vertices and edges in G and vertices are adjacent in T(G) if they are adjacent or incident in G. We try to obtain the degree sequence of total graphs of particular graphs like complete graph, path, cycle, wheel and star, from the number of vertices of the given graph (without directly drawing the total graph). We also explain the decomposition of T(G) into G and K_(d_i )s where dis are degrees of each of the vertices in G, moreover discuss about the degree sequence of T(G)??T(Ge).