ON THE LOCATING CHROMATIC NUMBER OF DISJOINT UNION OF BUCKMINSTERFULLERENE GRAPHS
Let be a connected non-trivial graph. Let c be a proper vertex-coloring using k colors, namely . Let be a partition of induced by , where is the color class that receives the color . The color code, denoted by , is defined as , where for , and is the distance between two vertices...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Pattimura
2024-05-01
|
| Series: | Barekeng |
| Subjects: | |
| Online Access: | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/11384 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|