E-Colouring of a Graph


Abstract views: 20 / PDF downloads: 16

Authors

  • D. K. Thakkar Department of Mathematics, Saurashtra University, Rajkot, India
  • V. R. Dave Shree M. & N. Virani Science College, Kalavad Road, Rajkot, India

Keywords:

E-Colouring, E-Chromatic Colouring, E-Chromatic Number, E-Homomorphism, Equitable Independent Set, Maximal Equitable Independent Set, Transversal, Colour Class

Abstract

In this paper we introduce a new colouring of graphs called E -- Colouring. This is not a proper colouring in general. We also define E -- Chromatic Number and E - Homomorphism of a graph. We prove several related results. In particular we prove that for a given E -- chromatic colouring there is a vertex in every colour class which has an equitable neighbour in every other colour class.

 

Author Biographies

D. K. Thakkar, Department of Mathematics, Saurashtra University, Rajkot, India

 

 

V. R. Dave, Shree M. & N. Virani Science College, Kalavad Road, Rajkot, India

 

 

Downloads

Published

01-05-2016

How to Cite

D. K. Thakkar, & V. R. Dave. (2016). E-Colouring of a Graph. International Journal of Mathematics And Its Applications, 4(2 - A), 31–35. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/1002

Issue

Vol. 4 No. 2 - A (2016)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.