Hiindex LOGO

Research Article

A Cyclic Coloring Of Central Graph Of Gear Graph Families


Author(s): R.Arundhadhi , K.Thirusangu
Affiliation: Dept. of Mathematics, D.G.Vaishnav College, Chennai
Year of Publication: 2013
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:

<a href="http://www.hindex.org/2013/article.php?page=966"><img src="http://www.hindex.org/sai.php/2013SCIA316F0966" alt="SAI"></a>


File:

http://www.hindex.org/2013/p966.pdf


Citation: R.Arundhadhi, K.Thirusangu. "A Cyclic Coloring Of Central Graph Of Gear Graph Families." International Journal of Computing Algorithm 2.1 (2013): 75-77.

Abstract:
An acyclic coloring of a graph G is a proper vertex coloring no two adjacent vertices of G have the same color such that the induced sub graph of any two color classes is acyclic. The minimum number of colors required for acyclic coloring of a graph G is called as its acyclic chromatic number and is denoted by aG. In this paper, we present the structure and coloring algorithm of central graph of Gear Graph Gn and we obtain the exact value of its acyclic chromatic number.


Keywords induced sub graph, bicolored cycle, acyclic coloring, acyclic chromatic number, central graph, Gear graph.


  • BibTex
  • Reference
  • XML
  • JSON
  • Dublin Core
  • CSL

@article{ACy1396677, author = {R.Arundhadhi,K.Thirusangu}, title = {A Cyclic Coloring Of Central Graph Of Gear Graph Families}, journal={International Journal of Computing Algorithm}, volume={2}, issue={1}, issn = {2278-2397}, year = {2013}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] [1]B.GrunBaum, Acyclic coloring of Planar graphs,Isreal J.Math.1431973 390-408.
  • [2] [2]J.Akiyama, T.Hamada and I.Yashimura, Graphs TRU Math.101974 41-52.
  • [3] [3]J.Akiyama, T.Hamada and I.Yashimura, On characterizations of the Middle graphs,TRU Math.11197535-39.
  • [4] [4]T.Hamada and I.Yashimura, Traversability and connectivity of the Middle graph of a graph,Discrete Math.141976,247-256.
  • [5] [5]J.Akiyama, T.Hamada ,The Decomposition of line graphs, Middle graphs and Total Graphs of complete graphs into forests, Discrete Math.261979203-208.
  • [6] [6]K.Thilagavathi ,Vernold Vivin.J and Akbar Ali.M ,On harmonius Coloring of Central Graphs,Advances and application in Discrete Mathematics. 2,2009 17-33.
  • [7] [7]K.Thilagavathi, D.Vijayalakshmi and Roopesh, B-Coloring of central Graphs, International Journal of computer applications, vol 3 11,2010 27 – 29.
  • [8] [8]K.Thilagavathi and Shahnas Banu, Acyclic coloring of star Graph families,International journal of computer Applications,vol-72,201031-33.
  • [9] [9]R.Arundhadhi and R.Sattanathan, Acyclic coloring of wheel Graph families, Ultra Scientist of physical sciences,vol-23,No 3A,2011709-716.
  • [10] [10]R,Arundhadhi and R.Sattanathan, Acyclic coloring of central Graphs , International Journal of computer Applications, Vol-38,12,8, Jan’2012,Online publications 55-57.
  • [11] [11]R.Arundhadhi and R.Sattanathan, Acyclic coloring of Central graph of path on n-vertices and central graph of Fan graph Fm,n,
  • [12] International Conference on Mathematics in Engineering and Business- March-2012.
  • [13] [12]R,Arundhadhi and R.Sattanathan, Acyclic and star coloring of Bistar Graph families,International journal of Scientific and Research Publications,vol-2, iss-3March 20121-4.
  • [14] R,Arundhadhi and R.Sattanathan, Star coloring of Wheel Graph families, International Journal of computer Applications, Vol-44,23April,2012,Online publications26-29.

  • <?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2013</publicationDate> <volume>2</volume> <issue>1</issue> <startPage>75</startPage> <endPage>77</endPage> <documentType>article</documentType> <title language='eng'>A Cyclic Coloring Of Central Graph Of Gear Graph Families</title> <authors> <author> <name>R.Arundhadhi</name> </author> </authors> <abstract language='eng'>An acyclic coloring of a graph G is a proper vertex coloring no two adjacent vertices of G have the same color such that the induced sub graph of any two color classes is acyclic. The minimum number of colors required for acyclic coloring of a graph G is called as its acyclic chromatic number and is denoted by aG. In this paper, we present the structure and coloring algorithm of central graph of Gear Graph Gn and we obtain the exact value of its acyclic chromatic number.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2013/p966.pdf</fullTextUrl> <keywords language='eng'> <keyword>induced sub graph, bicolored cycle, acyclic coloring, acyclic chromatic number, central graph, Gear graph.</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2013/article.php?page=966", "name":"A Cyclic Coloring Of Central Graph Of Gear Graph Families", "author":[{"name":"R.Arundhadhi "}], "datePublished":"2013", "description":"An acyclic coloring of a graph G is a proper vertex coloring no two adjacent vertices of G have the same color such that the induced sub graph of any two color classes is acyclic. The minimum number of colors required for acyclic coloring of a graph G is called as its acyclic chromatic number and is denoted by aG. In this paper, we present the structure and coloring algorithm of central graph of Gear Graph Gn and we obtain the exact value of its acyclic chromatic number.", "keywords":["induced sub graph, bicolored cycle, acyclic coloring, acyclic chromatic number, central graph, Gear graph."], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

    <?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>K.Thirusangu</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>R.Arundhadhi</dc:creator> <dc:date>2013</dc:date> <dc:description>An acyclic coloring of a graph G is a proper vertex coloring no two adjacent vertices of G have the same color such that the induced sub graph of any two color classes is acyclic. The minimum number of colors required for acyclic coloring of a graph G is called as its acyclic chromatic number and is denoted by aG. In this paper, we present the structure and coloring algorithm of central graph of Gear Graph Gn and we obtain the exact value of its acyclic chromatic number.</dc:description> <dc:identifier>2013SCIA316F0966</dc:identifier> <dc:language>eng</dc:language> <dc:title>A Cyclic Coloring Of Central Graph Of Gear Graph Families</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2013SCIA316F0966", "abstract": "An acyclic coloring of a graph G is a proper vertex coloring no two adjacent vertices of G have the same color such that the induced sub graph of any two color classes is acyclic. The minimum number of colors required for acyclic coloring of a graph G is called as its acyclic chromatic number and is denoted by aG. In this paper, we present the structure and coloring algorithm of central graph of Gear Graph Gn and we obtain the exact value of its acyclic chromatic number.", "author": [ { "family": "R.Arundhadhi,K.Thirusangu" } ], "id": "966", "issued": { "date-parts": [ [ 2013 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " A Cyclic Coloring Of Central Graph Of Gear Graph Families", "type": "publication-article", "version": "3" }