Vertex Coloring Edge-Weighting of Coronation by Path Graphs
In this paper, we study vertex coloring edge of corona graph. A k-edge weigting of graph G is mapping w : (EG) ! f1; 2; ; kg. An edge-weighting w induces a vertex coloring Fw : V (G) ! N de ned by fw(v) = P v2e w(e). An edge-weighting w is vertex coloring if fw(u) 6= fw(v) for any edge uv. Chang, et...
Saved in:
Main Authors: | , , , , , |
---|---|
Format: | Academic Paper |
Published: |
IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012004,
2020-06-25T05:25:37Z.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |