Please use this identifier to cite or link to this item: http://drsr.daiict.ac.in//handle/123456789/686
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorMuthu, Rahul
dc.contributor.authorPatel, Dhaval
dc.date.accessioned2018-05-17T09:29:56Z
dc.date.available2018-05-17T09:29:56Z
dc.date.issued2017
dc.identifier.citationDhaval Patel(2017).Study of Total Graph Using Dynamic Graph Operation.Dhirubhai Ambani Institute of Information and Communication Technology.v, 24 p.(Acc.No: T00650)
dc.identifier.urihttp://drsr.daiict.ac.in//handle/123456789/686
dc.description.abstract"Auxiliary graphs are graphs which are used to translate one graph problem to another graph problem. Total graph is also an auxiliary graph which is used to translate the total coloring problem into the vertex coloring problem. Dynamic graph operation on a graph is defined as sequence of update operation on the graph, where update operations are add vertex/edge and remove edge/vertex. This thesis derives some new characteristics of total graph. By using existing properties and new properties, we have developed algorithms to find maximal total sub graph of an arbitrary nontotal graph. We have devised a procedure by using which we are able tomigrate set of edges form vertex-vertex part to edgevertex part, together with some allied operations such that the resulting graph is also a total graph. For super total graph we have provided some characteristics which is required to add a vertex/edge."
dc.publisherDhirubhai Ambani Institute of Information and Communication Technology
dc.subjectAlgorithm
dc.subjectVertex Coloring problem
dc.subjectGraph theory
dc.subjectTheorem
dc.classification.ddc511.5 PAT
dc.titleStudy of Total Graph Using Dynamic Graph Operation
dc.typeDissertation
dc.degreeM.Tech.
dc.student.id201511033
dc.accession.numberT00650
Appears in Collections:M Tech Dissertations

Files in This Item:
File Description SizeFormat 
201511033.pdf
  Restricted Access
201511033607.28 kBAdobe PDFThumbnail
View/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.