AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS

Volume: 9 Number: 2 June 1, 2019
  • Veninstine Vivik J.
  • Girija G.
TWMS Journal of Applied and Engineering Mathematics Cover
TWMS Journal of Applied and Engineering Mathematics
PDF Download
EN

AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS

Abstract

The equitable edge chromatic number is the minimum number of colors required to color the edges of graph G, for which G has a proper edge coloring and if the number of edges in any two color classes di er by at most one. In this paper, we obtain the equitable edge chromatic number of Sn, Wn, Hn and Gn.

Keywords

References

  1. [1] J. A. Bondy, U. S. R. Murty, (1976), Graph Theory with Applications, New York; The Macmillan Press Ltd.
  2. [2] Frank Harary, (1969), Graph Theory, Narosa Publishing home.
  3. [3] A.J.W.Hilton, D.de Werra, A sufficient condition for equitable edge-colorings of simple graphs, (1994), Discrete Mathematics, V.128, 179-201.
  4. [4] K. Kaliraj, J. Vernold Vivin, M.M.Ali Akbar, Equitable Coloring on Mycielskian Of Wheels And Bigraphs, (2013), Applied Mathematics E-Notes, V.13, 174-182.
  5. [5] W. Meyer, Equitable Coloring, (1973), Amer. Math. Monthly, V.80 , 920-922.
  6. [6] J.Veninstine Vivik and G.Girija, Equitable edge coloring of some graphs, (2015), Utilitas Mathematica, V.96, 27–32.
  7. [7] V.G. Vizing, Critical graphs with given chromatic class, (1965), Metody Diskret. Analiz, V.5, 9-17.
  8. [8] Xia Zhang and Guizhen Liu, Equitable edge-colorings of simple graphs, (2010), Journal of Graph Theory, V.66, 175-197.

Details

Primary Language

English

Subjects

-

Journal Section

-

Authors

Veninstine Vivik J. This is me

Girija G. This is me

Publication Date

June 1, 2019

Submission Date

-

Acceptance Date

-

Published in Issue

Year 2019 Volume: 9 Number: 2

IZ

https://izlik.org/JA46JK77KL

Cite

RIS / Bibtex
APA
J., V. V., & G., G. (2019). AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS. TWMS Journal of Applied and Engineering Mathematics, 9(2), 374-383. https://izlik.org/JA46JK77KL
AMA
1.J. VV, G. G. AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS. JAEM. 2019;9(2):374-383. https://izlik.org/JA46JK77KL
Chicago
J., Veninstine Vivik, and Girija G. 2019. “AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS”. TWMS Journal of Applied and Engineering Mathematics 9 (2): 374-83. https://izlik.org/JA46JK77KL.
EndNote
J. VV, G. G (June 1, 2019) AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS. TWMS Journal of Applied and Engineering Mathematics 9 2 374–383.
IEEE
[1]V. V. J. and G. G., “AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS”, JAEM, vol. 9, no. 2, pp. 374–383, June 2019, [Online]. Available: https://izlik.org/JA46JK77KL
ISNAD
J., Veninstine Vivik - G., Girija. “AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS”. TWMS Journal of Applied and Engineering Mathematics 9/2 (June 1, 2019): 374-383. https://izlik.org/JA46JK77KL.
JAMA
1.J. VV, G. G. AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS. JAEM. 2019;9:374–383.
MLA
J., Veninstine Vivik, and Girija G. “AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS”. TWMS Journal of Applied and Engineering Mathematics, vol. 9, no. 2, June 2019, pp. 374-83, https://izlik.org/JA46JK77KL.
Vancouver
1.Veninstine Vivik J., Girija G. AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS. JAEM [Internet]. 2019 Jun. 1;9(2):374-83. Available from: https://izlik.org/JA46JK77KL