Total Chromatic Number of Star and Bistar Graphs
Muthuramakrishnan, D. and Jayaraman, G (2017) Total Chromatic Number of Star and Bistar Graphs. International Journal of Pure and Applied Mathematics, 117 (21). pp. 699-708. ISSN 1311-8080
60.pdf
Download (872kB)
Abstract
A total coloring of a graph G is an assignment of colors to both the vertices and edges of G, such that no two adjacent or incident vertices and edges of G are assigned the same colors. In this paper, we have discussed middle, total, line graph of star and square graph of bistar graph.
| Item Type: | Article |
|---|---|
| Subjects: | Mathematics > Graph Theory |
| Domains: | Mathematics |
| Depositing User: | Mr IR Admin |
| Date Deposited: | 11 May 2026 11:18 |
| Last Modified: | 11 May 2026 11:18 |
| URI: | https://ir.vistas.ac.in/id/eprint/17807 |
