On The Packing k-Coloring of Unicyclic Graph Family
All graph in this paper is connected graph. Let du,v be a distance between any vertex u and v in graph GV,E. A function c :VG 1, 2, , k is called a packing k coloring if every two vertex of color i are at least distance i 1. G p or packing chromatics number of graph G is the smalles...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Academic Paper |
| Veröffentlicht: |
International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January - 2020, Pages: 1-9,
2020-06-25T04:30:08Z.
|
| Schlagworte: | |
| Online Zugang: | Get Fulltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Online
Get Fulltext3rd Floor Main Library
| Signatur: |
A1234.567 |
|---|---|
| Exemplar 1 | Verfügbar |