The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
Work
Year: 2022
Type: article
Abstract: The edge-distinguishing chromatic number (EDCN) of a graph G is the minimum positive integer k such that there exists a vertex coloring c : V ( G )→{1, 2, …, k } whose induced edge labels { c ( u ), c... more
Authors Grant Fickes, Tony W. H. Wong
Institutions University of South Carolina, Kutztown University
Cites: 15
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond