Chromatic numbers and indices of the optimised degree six 3-modified chordal ring network topology
Graph colouring is the labelling of the elements of a graph subject to certain constraints. It is divided into vertex and edge colouring. In both cases, the assignment of labels, traditionally called colours is such that two vertices or edges must not have the same colour. This has various applicati...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTM Press
2017
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/52398/1/Chromatic%20numbers%20and%20indices%20of%20the%20optimised%20degree%20six%203-modified%20chordal%20ring%20network%20topology.pdf |