TOTAL COLORING OF CERTAIN GRAPHS
Dimensions
Dimensions
DimensionsMuthuramakrishnan, D. and Jayaraman, G (2021) TOTAL COLORING OF CERTAIN GRAPHS. Advances and Applications in Discrete Mathematics, 27 (1). pp. 31-38. ISSN 09741658
![[thumbnail of DM027010031.pdf]](https://ir.vistas.ac.in/style/images/fileicons/text.png)
Text
DM027010031.pdf
Download (655kB)
Official URL: https://doi.org/10.17654/DM027010031
Abstract
A total coloring of a graph G is an assignment of colors to both vertices and edges of G, such that no two adjacent or incident vertices of G receive the same color. In this paper, we have discussed the total coloring and total chromatic number of twig graph, splitting graph of comb graph and shadow graph of comb graph.
| Item Type: | Article |
|---|---|
| Subjects: | Mathematics > Graph Theory |
| Domains: | Mathematics |
| Depositing User: | Mr IR Admin |
| Date Deposited: | 11 May 2026 05:32 |
| Last Modified: | 11 May 2026 05:32 |
| URI: | https://ir.vistas.ac.in/id/eprint/15721 |
Actions (login required)
- View Item