EN
SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH
Abstract
A total coloring of a graph is a proper coloring in which no two adjacent or incident graph elements receive the same color. The total chromatic number of a graph is the smallest positive integer for which the graph admits a total coloring. In this paper, we derive some results on total chromatic number of a graph.
Keywords
References
- Behzad,M., (1965), Graphs and their chromatic numbers, Ph.D Thesis, Michigan University.
- Behzad,M., Chartrand,G., and Cooper,Jr.J.K., (1967), The colour numbers of complete graphs, J. London Math. Soc., 42, pp.226-228.
- Irving,R.W. and Manlove,D.F., (1999), The b-chromatic number of a graph, Discrete Applied Math- ematics, 91,(1-3), pp.127-141.
- Kostochka,A.V., (1996), The total chromatic number of any multigraph with maximum degree five is at most seven, Discrete Math, 162, pp.199-214.
- Rosenfeld,M., (1971), On the total coloring of certain graphs, Israel J. Math., 9(3), pp.396-402.
- Vaidya,S.K. and Barasara,C.M., (2011), Product Cordial Graphs in the Context of Some Graph Operations, International Journal of Mathematics and Scientific Computing, 1(3), pp.1-6.
- Vaidya,S.K., Dani,N.A., Kanani,K.K., and Vihol,P.L., (2011), Cordial and 3-equitable Labeling for Some Wheel Related Graphs, IAENG International Journal of Applied Mathematics , 41(2), pp.99- 105.
- Vaidya,S.K. and Isaac,Rakhimol V., (2015), Total coloring of some cycle related graphs, IOSR Journal of Mathematics, 11(3)(V), pp.51-53.
Details
Primary Language
English
Subjects
-
Journal Section
-
Publication Date
December 1, 2017
Submission Date
-
Acceptance Date
-
Published in Issue
Year 2017 Volume: 7 Number: 2
APA
Vaidya, S. K., & Isaac, R. V. (2017). SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH. TWMS Journal of Applied and Engineering Mathematics, 7(2), 332-336. https://izlik.org/JA29TN35PC
AMA
1.Vaidya SK, Isaac RV. SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH. JAEM. 2017;7(2):332-336. https://izlik.org/JA29TN35PC
Chicago
Vaidya, S. K., and Rakhimol V. Isaac. 2017. “SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH”. TWMS Journal of Applied and Engineering Mathematics 7 (2): 332-36. https://izlik.org/JA29TN35PC.
EndNote
Vaidya SK, Isaac RV (December 1, 2017) SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH. TWMS Journal of Applied and Engineering Mathematics 7 2 332–336.
IEEE
[1]S. K. Vaidya and R. V. Isaac, “SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH”, JAEM, vol. 7, no. 2, pp. 332–336, Dec. 2017, [Online]. Available: https://izlik.org/JA29TN35PC
ISNAD
Vaidya, S. K. - Isaac, Rakhimol V. “SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH”. TWMS Journal of Applied and Engineering Mathematics 7/2 (December 1, 2017): 332-336. https://izlik.org/JA29TN35PC.
JAMA
1.Vaidya SK, Isaac RV. SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH. JAEM. 2017;7:332–336.
MLA
Vaidya, S. K., and Rakhimol V. Isaac. “SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH”. TWMS Journal of Applied and Engineering Mathematics, vol. 7, no. 2, Dec. 2017, pp. 332-6, https://izlik.org/JA29TN35PC.
Vancouver
1.S. K. Vaidya, Rakhimol V. Isaac. SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH. JAEM [Internet]. 2017 Dec. 1;7(2):332-6. Available from: https://izlik.org/JA29TN35PC