Total Coloring of Splitting Graph of Some Standard Graphs
Jayaraman, G and Muthuramakrishnan, D. (2018) Total Coloring of Splitting Graph of Some Standard Graphs. Total Coloring of Splitting Graph of Some Standard Graphs, 120 (8). pp. 157-165. ISSN 1314-3395
![[thumbnail of P15-Sco NI.pdf]](https://ir.vistas.ac.in/style/images/fileicons/text.png)
Text
P15-Sco NI.pdf
Download (974kB)
Abstract
A total coloring of a graph G is an assignment of colors to both the vertices and the edges of G such that no two adjacent or incident vertices and edges of G are assigned with the same colors. In this paper, we found that total chromatic number of splitting graph of bistar, complete bipartite graph, fan graph and wheel graph.
| Item Type: | Article |
|---|---|
| Subjects: | Mathematics > Graph Theory |
| Domains: | Mathematics |
| Depositing User: | Mr IR Admin |
| Date Deposited: | 11 May 2026 10:17 |
| Last Modified: | 11 May 2026 10:18 |
| URI: | https://ir.vistas.ac.in/id/eprint/17521 |
Actions (login required)
- View Item