Degree tolerant coloring: Graphs from graphs
Downloads
DOI:
https://doi.org/10.26637/MJM0804/0009Abstract
Degree tolerant coloring is a study on a new coloring regime which sets conditions in respect of \(\operatorname{deg}(v)\) and \(\operatorname{deg}(u)\) where, \(v, u \in V(G)\) and \(v u \in E(G)\). Results for graphs from graphs or (derivative graphs) such the line graph, the middle graph, the total graph, the power graph and others, are presented in this paper.
Keywords:
Degree tolerant coloring,, degree tolerant chromatic number, proper coloring, defect coloring.Mathematics Subject Classification:
Mathematics- Pages: 1387-139`1
- Date Published: 01-10-2020
- Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. Macmillan Press, London, 2017.
F. Harary, Graph Theory. Addison-Wesley, Reading MA, 1969.
E.G. Mphako-Banda, An introduction to the $k$-defect polynomials, Quaestiones Mathematicae, (2018), 1-10.
J. Kok, Degree Tolerant Coloring of Graphs, Communicated.
J. Kok, N.K. Sudev and M. Jamil, Rainbow neighbourhood number of graphs. Proyecciones Journal of Mathematics., 38(3)(2019), 469-485.
B. West, Introduction to Graph Theory, Prentice-Hall, Upper Saddle River, 1996.
- NA
Similar Articles
- A. Arul Selvi, P. Senthil Kumar, An analysis of Mettur Dam inflow and outflow using subcritical branching systems , Malaya Journal of Matematik: Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)
You may also start an advanced similarity search for this article.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.
