Total Chromatic Number of Double Star Graph Families
Jayaraman, G and Muthuramakrishnan, D. (2018) Total Chromatic Number of Double Star Graph Families. Jour of Adv Research in Dynamical & Control Systems, 10 (5). ISSN 1943-023X
![[thumbnail of P14 Sco I.pdf]](https://ir.vistas.ac.in/style/images/fileicons/text.png)
Text
P14 Sco I.pdf
Download (430kB)
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 the total coloring of middle, total, line and splitting graph of double star graph.
| Item Type: | Article |
|---|---|
| Subjects: | Mathematics > Graph Theory |
| Domains: | Mathematics |
| Depositing User: | Mr IR Admin |
| Date Deposited: | 11 May 2026 09:58 |
| Last Modified: | 11 May 2026 09:58 |
| URI: | https://ir.vistas.ac.in/id/eprint/17333 |
Actions (login required)
- View Item
Altmetric
Altmetric