ON THE RAINBOW NEIGHBOURHOOD NUMBER
OF MYCIELSKI TYPE GRAPHS

Abstract

A rainbow neighbourhood of a graph $G$ is the closed neighbourhood $N[v]$ of a vertex $v \in V(G)$ which contains at least one colored vertex of each color in the chromatic coloring $\mathcal C$ of $G$. Let $G$ be a graph with a chromatic coloring $\mathcal C$ defined on it. The number of vertices in $G$ yielding rainbow neighbourhoods is called the rainbow neighbourhood number of the graph $G$, denoted by $r_\chi(G)$. In this paper, we discuss the rainbow neighbourhood number of the Mycielski type graphs of graphs.

Citation details of the article



Journal: International Journal of Applied Mathematics
Journal ISSN (Print): ISSN 1311-1728
Journal ISSN (Electronic): ISSN 1314-8060
Volume: 31
Issue: 6
Year: 2018

DOI: 10.12732/ijam.v31i6.8

Download Section



Download the full text of article from here.

You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.

References

  1. [1] G. Chartrand and P. Zhang, Chromatic Graph Theory, CRC Press, Boca Raton (2009).
  2. [2] F. Harary, Graph Theory, New Age International, New Delhi (2001).
  3. [3] T.R. Jensen and B. Toft, Graph Coloring Problems, John Wiley & Sons (1995).
  4. [4] J. Kok, N.K. Sudev, M.K. Jamil, Rainbow neighbourhoods of graphs, Proy. J. Math., (2018), In Press.
  5. [5] W. Lin, J. Wu, P.C.B. Lam, G. Gu, Several parameters of generalized Mycielskians, Discrete Appl. Math., 154, No 8 (2006), 1173-1182; DOI:10.1016/j.dam.2005.11.001.
  6. [6] N.K. Sudev, C. Susanth, S.J. Kalayathankal, J. Kok, A note on the rainbow neighbourhood number of graphs, Nat. Acd. Sci. Lett., Online First (2018); DOI: 10.1007/s40009-018-0702-6.
  7. [7] N.K. Sudev, C. Susanth, S.J. Kalayathankal, J. Kok, Some new results on the rainbow neighbourhood number of graphs, Nat. Acd. Sci. Lett., Online First (2018); DOI: 10.1007/s40009-018-0740-0.
  8. [8] D.B. West, Introduction to Graph Theory, Pearson Education Inc., Delhi (2001).