Rainbow Connection Number and Chromatic Index of Rough Ideal based Rough Edge Cayley Graph

  • Authors

    • B. Praba SSN College of Engineering
    • X.A. Benazir Obilia SSN College of Engineering
    2018-08-24
    https://doi.org/10.14419/ijet.v7i3.13094
  • Distance, Path, Edge Colouring, Connected

  • Rainbow connection number and chromatic index are two significant parameters in the study of
    graph theory. In this work, rainbow connection number and chromatic index of Rough Ideal based Rough Edge Cayley Graph G(T(J)) are evaluated. We prove that the rainbow connection number of G(T(J)) is 2 and the chromatic index of G(T(J)) is 2(2n^m)(3m^1):

    Rainbow connection number and chromatic index are two significant parameters in the study of graph theory. In this work, rainbow connection number and chromatic index of Rough Ideal based Rough Edge Cayley Graph  are evaluated. We prove that the rainbow connection number of  is 2 and the chromatic index of  is .

  • References

    1. [1] J.A.Bondy and U.S.R.Murty, (1976), Graph theory with applications, University of Waterloo, Ontario, Canada.

      [2] Hengzhe li, Xueliang li, (2017), rainbow Connection Number of Graphs with Diameter 3, Discussiones Mathematicae, No: 37, Pg.: 141-154.

      [3] Meilian Liang, Binmei Liang, Linna Wei and Xiadong Xu, (2011), Edge rough graph and its applications, 8th International conference on Fuzzy systems and Knowledge discovery, Pg.:335-338.

      [4] B. Praba and R. Mohan, (2013), Rough Lattice, International Journal of Fuzzy Mathematics and Systems, Volume 3, Number 2, Pg.: 135- 151.

      [5] B.Praba, V.M.Chandrasekaran and A.Manimaran, (2015), Semiring on Rough sets, Indian Journal of Science and Technology, Vol.8 (3), Pg.: 280-286.

      [6] B.Praba and Benazir Obilia.X.A, Domination number of Rough Ideal based rough Edge Cayley Graph, Accepted for Cambridge summit 2018.

      [7] B.Praba and Benazir Obilia.X.A, (2017), Domination number of Rough Ideal based rough Edge Cayley Graph through Category Graph, International Journal of Pure and Applied Mathematics, No.9, Pg.: 187-191.

      [8] Robert Green, Vizing’s Theorem and Edge Chromatic Graph Theory, math.uchicago.edu/ may/REU2015/REUPapers/Green.pdf.

      [9] M.H. Shahzamanian, M. Shirmohammadi, B. Davvaz, (2010), Roughness in Cayley Graphs, Information Sciences 180, Pg.: 3362-3372.

      [10] L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, and Nithin M. Varma, (2010), Rainbow Connection Number and Connected Dominating Sets, arXiv : 1010.2296v1 [math.CO].

      [11] Dr. A. Sudhakaraiah, E.Gnana Deepika, V. Rama Latha, (2012), Rainbow Connection Number and the Diameter of Interval Graphs, IOSR Journal of Mathematics (IOSRJM) Volume 1, Issue 1, Pg.: 36-43.

      [12] Xueliang Li, Sujuan Liu, (2012), Rainbow Connection Number and Connectivity, The electronic Journal of Combinatorics, 19.

      [13] Yingbin Ma, Zaiping Lu, (2017), Rainbow connection numbers of Cayley graphs, Journal of Combinatorial Optimization, No: 34, Pg.:182–190.

      [14] Zdzislaw Pawlak, “Rough Setsâ€, (1982), International Journal of Computer and Information Sciences, Vol.11, Pg.: 341-356.

  • Downloads

  • How to Cite

    Praba, B., & Obilia, X. B. (2018). Rainbow Connection Number and Chromatic Index of Rough Ideal based Rough Edge Cayley Graph. International Journal of Engineering & Technology, 7(3), 1926-1930. https://doi.org/10.14419/ijet.v7i3.13094