• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage StatisticsView Google Analytics Statistics

    Acyclic edge coloring of complete r-partite graphs

    Thumbnail
    View/Open
    200911042.pdf (1016.Kb)
    Date
    2011
    Author
    Teja, V. Krishna
    Metadata
    Show full item record
    Abstract
    An acyclic edge coloring of a graph G is a proper edge coloring of G which has no dichromatic cycle. The minimum number of colors required to acyclically edge color graph G is called its acyclic chromatic index, denoted a’ (G). In this thesis, we present an acyclic edge coloring for complete graphs Ka, b, where a>b and a is prime, using Δ (G) =a colors. An acyclic edge coloring for complete tripartite graphs, and r-partite graphs (r>3) is presented. These colorings follow patterns similar to those used in the case of complet bipartite graphs.
    URI
    http://drsr.daiict.ac.in/handle/123456789/360
    Collections
    • M Tech Dissertations [923]

    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     


    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV