The Metric Chromatic Number of Zero Divisor Graph of a Ring Zn
Let Γ be a nontrivial connected graph, c:VΓ⟶ℕ be a vertex colouring of Γ, and Li be the colouring classes that resulted, where i=1,2,…,k. A metric colour code for a vertex a of a graph Γ is ca=da,L1,da,L2,…,da,Ln, where da,Li is the minimum distance between vertex a and vertex b in Li. If ca≠cb, for...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2022/9069827 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|