0 Up votes0 Down votes

31 views4 pagesAn 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 a(G). 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

Oct 08, 2013

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

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 a(G). 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

Attribution Non-Commercial (BY-NC)

31 views

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 a(G). 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

Attribution Non-Commercial (BY-NC)

- Risk Safety Barrier Diagrams & Quantification
- Sham Daa Mcq
- Cheat
- Graph Coloring Algorithm
- N D
- Franzè, Lucia, Tedesco, A Dwell-time Based Command Governor Approach for Constrained Switched Systems
- MCS - 102
- Paper Crossingcoloring
- Dagajal 150302145746 Conversion Gate02
- PCP Handouts
- protasi
- [HighlyRelated_to_OurProblem] ICML11_Uncovering the Temporal Dynamics of Diffusion Networks (1)
- A note on the shameful conjecture - S. Fadnavis.pdf
- Chapter 8
- graphs_groups_symmetry
- Graph Theory
- NotesRGCN
- 1-s2.0-S1877705812031803-main
- Lecture4 Dynamic Programming1
- 40.IJMPERDJUN201940

You are on page 1of 4

R.Arundhadhi1, K.Thirusangu2 Dept. of Mathematics, D.G.Vaishnav College,Chennai-106. 2 Dept. of Mathematics, S.I.V.E.T College, Gowriwakkam, Chennai arundhadhinatarajan@gmail.com

1

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 a(G). 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. 1. Introduction A graph with vertex set V and edge set E is generally denoted by G = (V,E). All graphs considered here are simple and undirected. In the whole paper, the term coloring will be used to define vertex coloring of graphs. A proper coloring of a graph G is a coloring of the vertices of G such that no two neighbors in G are assigned the same color. 1.1. Definition A sub graph H of a graph G is said to be an induced sub graph if it has all the edges that appear in G over the same vertex set. The sub graph induced by the vertex set {v1, v2,..,vk} is denoted by <v1,v2,..,vk>. 1.2. Definition A cycle in a graph G is said to be a bicolored (j,k)-cycle if all its vertices are properly colored with two colors j and k. A graph G is said to be a (j,k)-cycle free graph if it do not have any bicolored (j,k)-cycle. 1.3. Definition A vertex coloring of a graph is said to be acyclic[1] if the induced sub graph of any two color classes is acyclic. In other words, the sub graph induced by any two color classes is a forest. 1.4. Definition The minimum number of colors needed to a cyclically color the vertices of a graph G is called as its acyclic chromatic number and is denoted by a (G). 1.5. Definition The Gear graph Gn, is the graph obtained from the wheel graph Wn, by introducing a vertex between every pair of adjacent vertices of the outer n-cycle. So, the Gear graph Gn will have 2n+1 vertices and 3n edges. Let v be the root vertex and v1,v2,,v2n be the vertices of the outer 2n-cycle. Let v1,v3,,v2n-1 be the vertices connected with v and v2,v4,,v2n be the intermediate vertices of the outer cycle. 2. Acyclic coloring of C(Gn) 2.1. Definition Let G be a graph with vertex set V(G) and edge set E(G). The central graph of G, denoted by C(G) [ 6 ], is obtained from G by subdividing each edge exactly once and joining all the non adjacent vertices of G. In C(Gn), let ek( k= 1 to n ) be the newly introduced vertex on the edge joining v and v2k-1 and fk ( k= 1 to 2n-1) be the newly introduced vertex on the edge joining vk and vk+1 and f2n be the newly added vertex on the edge v2nv1. 2.2. Structural properties of C(Gn) By definition 2.1, C(Gn) has the following structural properties. (i). < v,v2k ; k= 1 to n > form a clique of order n+1.

235

Volume: 02, October 2013, Pages: 235-238 (ii) The neighbors of v are {e2k-1( k= 1 to n), v2k ( k= 1 to n). (iii).The neighbors of fk ( k= 1 to 2n-1) are {vk,vk+1} and that of f2n are {v2n,v1}. (iv).The neighbors of v2k-1 ( k= 2 to n) are {f2k-2,f2k-1,e2k-1,vj ( j= 1 to 2n and j2k,2k-2 } and that of v1 are { f2n,f1,e1,v3,v4,,v2n-1 }. (v).The neighbors of v2k ( k= 1 to n-1) are {v,f2k-1,f2k,vj ( j= 1 to 2n and j2k-1,2k+1} and that of v2n are {v, f2n-1,f2n,,v2,v3,,v2n-2 }. Now, we present the structure algorithm and coloring algorithm of C(Gn) and then we obtain the exact value of its acyclic chromatic number in the immediate theorem. 2.3. Structure Algorithm of C(Gn) Input : C(Gn) V { v,v1,v2,,v2n,e1,e3,,e2n-1,f1,f2,f2n} E { e1,e2,,e2n,e1,e3,,e2n-1, f1,f2,,f2n, f1,f2,,f2n,h13,h14,,h2n-1, hjk( j= 2 to 2n-1, k= j+2 to n )} for k= 1 to n { ve2k-1 e2k-1; vv2k e2k; v2k-1 e2k-1 e2k-1; } end for for k= 1 to 2n-1 { vkfk fk; } end for for k= 1 to 2n-1 { fkvk+1 fk; } end for f2nv1 f2n; for k= 3 to 2n-1 { v1vk h1k; } end for for j= 2 to 2n-2 { for k= j+2 to n { vjvk hjk;

International Journal of Computing Algorithm } end for end for end procedure 2.4. Coloring Algorithm of C(Gn) ,n 4. Input; C(Gn) V { v,v1,v2,,v2n,e1,e3,,e2n-1,f1,f2,f2n} E { e1,e2,,e2n,e1,e3,,e2n-1, f1,f2,,f2n, f1,f2,,f2n,h13,h14,,h2n-1, hjk( j= 2 to 2n-1, k= j+2 to n )} v 1; for k= 1 to 2n { fk 1; } end for v1 2; v3 3; for k= 3 to n { v2k-1 n+k-1; } end for for k= 1 to n { r k+2; if r n+1, e2k-1 r; else e2k-1 r-n; } end for 2.5. Theorem The acyclic chromatic number of central graph of Gear graph is a[C(Gn)] = 2n-1, n 4. Proof: We prove the theorem by showing the coloring, given in the coloring algorithm, is acyclic. As the two neighbors of e2k-1 have different colors, ve2k-1v2k-1 can not be contained in any bicolored cycle. Case(i) Consider the colors 1 and k, k=2,3. The color classes of 1 are {v, fk ; k= 1 to 2n} whereas the color class of 2 and 3 are respectively {v1,v2,e2n-1} and {v3,v4,e1}. The induced 236

Volume: 02, October 2013, Pages: 235-238 subgraph of these color classes contain respectively the bicolored path f2nv1f1v2 and f2v3f3v4 and therefore C(Gn) is (1,k)-cycle free graph. Case(ii) Consider the colors 1 and k, k= 4 to n+1. As any bicolored cycle must have atleast four vertices and the color class of k is {v2(k-1)}, C(Gn) is (1,k)-cycle free graph. Case(iii) Consider the colors 1 and k, k= (n+2) to (2n1). By the same argument as in case (ii), C(Gn) is (1,k)-cycle free graph. Case(iv) Consider the colors j and k, j=2,3 and k= 4 to (n+1). The induced subgraph contains the bicolored path v1v2(k-1)v2 (when j=2) and v3v2(k1)v4 (when j=3). Case(v) Consider the colors j and k, j=2,3 and k= (n+2) to (2n-1). By the same argument as in case (iv), C(Gn) is (j,k)-cycle free graph. Case(vi) .

International Journal of Computing Algorithm Consider the colors j and k, 4 j < k (n+1). The induced subgraph contains only the bicolored edge v2(j-1) v2(k-1) and hence C(Gn) is acyclic. Case(vii) Consider the colors j and k, (n+2) j < k (2n-1). The induced subgraph contains only the bicolored edge v2j-1 v2k-1 and hence C(Gn) is acyclic. Case(viii) Consider the colors j and k, 4 j < k (2n-1). The induced subgraph contains either a bicolored edge or isolated vertices and therefore ,C(Gn) is acyclic. Thus, the coloring given in the algorithm, is acyclic. As C(Gn) has a clique of order n+1, a[C(Gn)] (n+1). The colors (n+2) to (2n-1) are assigned to v5 to v2n-1. If, we suppose assign the same color to the vertices vk and vk+1, then v1vkv2vk+1v1 and v3vkv4vk+1v3 will form bicolored cycles. So, minimum (2n-1) colors are required for acyclic coloring. Therefore, a[C(Gn)]= 2n-1, n 4

237

Volume: 02, October 2013, Pages: 235-238 Conclusion We found the exact value of the acyclic chromatic number of central graph of Gear graph as follows a[C(Gn)] = 2n-1, n 4. 3. References [1]B.GrunBaum, Acyclic coloring of Planar graphs,Isreal J.Math.14(3)(1973) 390-408. [2]J.Akiyama, T.Hamada and I.Yashimura, Graphs TRU Math.10(1974) 41-52. [3]J.Akiyama, T.Hamada and I.Yashimura, On characterizations of the Middle graphs,TRU Math.11(1975)35-39. [4]T.Hamada and I.Yashimura, Traversability and connectivity of the Middle graph of a graph,Discrete Math.14(1976),247-256. [5]J.Akiyama, T.Hamada ,The Decomposition of line graphs, Middle graphs and Total Graphs of complete graphs into forests, Discrete Math.26(1979)203-208. [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]K.Thilagavathi, D.Vijayalakshmi and Roopesh, B-Coloring of central Graphs, International Journal of computer applications, vol 3( 11),(2010) 27 29.

International Journal of Computing Algorithm [8]K.Thilagavathi and Shahnas Banu, Acyclic coloring of star Graph families,International journal of computer Applications,vol7(2),(2010)31-33. [9]R.Arundhadhi and R.Sattanathan, Acyclic coloring of wheel Graph families, Ultra Scientist of physical sciences,vol-23,No 3(A),(2011)709-716. [10]R,Arundhadhi and R.Sattanathan, Acyclic coloring of central Graphs , International Journal of computer Applications, Vol38,12,8, (Jan2012,Online publications) 55-57. [11]R.Arundhadhi and R.Sattanathan, Acyclic coloring of Central graph of path on nvertices and central graph of Fan graph Fm,n, International Conference on Mathematics in Engineering and Business- March-2012. [12]R,Arundhadhi and R.Sattanathan, Acyclic and star coloring of Bistar Graph families,International journal of Scientific and Research Publications,vol-2, iss-3(March 2012)1-4. [13]R,Arundhadhi and R.Sattanathan, Star coloring of Wheel Graph families, International Journal of computer Applications, Vol-44,23(April,2012,Online publications)26-29.

238

- Risk Safety Barrier Diagrams & QuantificationUploaded bymowglitown
- Sham Daa McqUploaded byshambhand2020
- CheatUploaded byNeftali Roq Ba
- Graph Coloring AlgorithmUploaded byRajat Kumar
- N DUploaded byansuljaju
- Franzè, Lucia, Tedesco, A Dwell-time Based Command Governor Approach for Constrained Switched SystemsUploaded byFrancesco Tedesco
- MCS - 102Uploaded byRituparna Majumdar
- Paper CrossingcoloringUploaded byGita Pramudya Saraswati
- Dagajal 150302145746 Conversion Gate02Uploaded byNeha
- PCP HandoutsUploaded byMichael Belostoky
- protasiUploaded byAiolos Gr
- [HighlyRelated_to_OurProblem] ICML11_Uncovering the Temporal Dynamics of Diffusion Networks (1)Uploaded bySainyam Galhotra
- A note on the shameful conjecture - S. Fadnavis.pdfUploaded bymmmellyyyy
- Chapter 8Uploaded byMahesh Thallapelli
- graphs_groups_symmetryUploaded byGilleain Torrance
- Graph TheoryUploaded bySanjana Ganesh
- NotesRGCNUploaded byNina Brown
- 1-s2.0-S1877705812031803-mainUploaded byErik Geovanni
- Lecture4 Dynamic Programming1Uploaded bymna shourov
- 40.IJMPERDJUN201940Uploaded byTJPRC Publications
- Teach ChatUploaded byyyee81
- Journal of Machine Learning Research 10Uploaded byFalentine Langitan
- Max PlanarUploaded bydragance106
- Lec2 Network FlowsUploaded byChandra Mouli
- apachestormvizenginedocUploaded byapi-334517875
- 14-compactionUploaded byUsha Key Jay
- gSpan-11Uploaded byNitin Tembhurnikar
- Prims Algorithm Minimum Spanning TreeUploaded bydiorey_potestas
- One Modulo n Gracefulness OfUploaded byMegan Bell
- mosina.pdfUploaded byvanaj123

- Slow Intelligence Based Learner Centric Information Discovery SystemUploaded byIntegrated Intelligent Research
- A survey on the Simulation Models and Results of Routing Protocols in Mobile Ad-hoc NetworksUploaded byIntegrated Intelligent Research
- A Review on Role of Software-Defined Networking (SDN) in Cloud InfrastructureUploaded byIntegrated Intelligent Research
- Effective Approaches of Classification Algorithms for Text Mining ApplicationsUploaded byIntegrated Intelligent Research
- A Survey on Analyzing and Processing Data Faster Based on Balanced Partitioning_IIR_IJDMTA_V4_I2_006Uploaded byIntegrated Intelligent Research
- A Study for the Discovery of Web Usage Patterns Using Soft Computing Based Data Clustering TechniquesUploaded byIntegrated Intelligent Research
- Impact of Stress on Software Engineers Knowledge Sharing and Creativity [A Pakistani Perspective]Uploaded byIntegrated Intelligent Research
- Prediction of Tumor in Classifying Mammogram images by k-Means, J48 and CART AlgorithmsUploaded byIntegrated Intelligent Research
- A Study for the Discovery of Web Usage Patterns Using Soft Computing Based Data Clustering TechniquesUploaded byIntegrated Intelligent Research
- paper11.pdfUploaded byIntegrated Intelligent Research
- Applying Clustering Techniques for Efficient Text Mining in Twitter DataUploaded byIntegrated Intelligent Research
- Investigating Performance and Quality in Electronic Industry via Data Mining TechniquesUploaded byIntegrated Intelligent Research
- A New Arithmetic Encoding Algorithm Approach for Text ClusteringUploaded byIntegrated Intelligent Research
- Classification of Retinal Images for Diabetic Retinopathy at Non-Proliferative Stage using ANFISUploaded byIntegrated Intelligent Research
- Three Phase Five Level Diode Clamped Inverter Controlled by Atmel MicrocontrollerUploaded byIntegrated Intelligent Research
- A New Computer Oriented Technique to Solve Sum of Ratios Non-Linear Fractional Programming ProblemsUploaded byIntegrated Intelligent Research
- Associative Analysis of Software Development Phase DependencyUploaded byIntegrated Intelligent Research
- RobustClustering Algorithm Based on Complete LinkApplied To Selection ofBio- Basis forAmino Acid Sequence AnalysisUploaded byIntegrated Intelligent Research
- A Framework to Discover Association Rules Using Frequent Pattern MiningUploaded byIntegrated Intelligent Research
- Multidimensional Suppression for KAnonymity in Public Dataset Using See5Uploaded byIntegrated Intelligent Research
- Significance of Similarity Measures in Textual Knowledge MiningUploaded byIntegrated Intelligent Research
- A Review Paper on Outlier Detection using Two-Phase SVM Classifiers with Cross Training Approach for Multi- Disease DiagnosisUploaded byIntegrated Intelligent Research
- A Comparative Analysis on Credit Card Fraud Techniques Using Data MiningUploaded byIntegrated Intelligent Research
- Agricultural Data Mining –Exploratory and Predictive Model for Finding Agricultural Product PatternsUploaded byIntegrated Intelligent Research
- paper13.pdfUploaded byIntegrated Intelligent Research

- Strategic Marketing Planning New ProductsUploaded bycarollim1008
- Metodi 2010Uploaded byLucas Gabriel Casagrande
- DAA Decrease and Conquer ADAUploaded byachutha795830
- Design and AnalysisUploaded byflame1406
- MIT6_046JS15_pset1.pdfUploaded byajgemini
- CN-Unit-3-a(1)Uploaded byNancy
- A survey on sentence fusion techniques of abstractive text summarizationUploaded byAnonymous 7VPPkWS8O
- h2Uploaded byAmit Shekhar
- dyn_multi_alg.pdfUploaded byAlejandro Visiedo
- Ch3 System SecurityUploaded byAli Ahmad Butt
- Simulation and Performance Evaluation of DAG Construction with RPLUploaded byRyduano Vicent
- Mca4040 Winter 2016 solved assignmentUploaded byaapki education
- Bioinformatics Toolbox™ User’s GuideUploaded byKhai Huynh
- Skill SetUploaded byTavishi Singh
- IntermediateCode.pdfUploaded byKarthikeyan Ramajayam
- Bayesian NetworksUploaded byKonrad Witowski-Jeleń
- Assignment 1Uploaded byFarinFar
- graph_theory_notes.pdfUploaded bysonarika123
- Cs33- Data Structures Questions and AnswersUploaded bysri1bhu2
- Final SolUploaded byRaghu Vamsi Potukuchi
- 6438_CombinedNotesUploaded byAswin Shanmugam Subramanian
- Ada Lab Manual-rvceUploaded byJulie Gallagher
- graphUploaded byworking
- Mining Sequential PatternsUploaded byChu Văn Nam
- BGP No DivergenceUploaded byapi-3761983
- Function Passing: A Model for Typed, Distributed Functional ProgrammingUploaded byChetan Bhasin
- Extensions of the Petal Method for Vehicle Routeing.pdfUploaded by123away123
- WP-Understanding-Blockchain-Consensus-Models.pdfUploaded byDharmaraj Martyn
- Barber.bayesian.learningUploaded byb896476
- Bayesian Nets are reviewedUploaded byhello

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.