Vertex-coloring Edge-weightings of Graphs
Work
Year: 2011
Type: article
Abstract: A $k$-edge-weighting of a graph $G$ is a mapping $w: E(G) \to \{1,2,\ldots, k\}$. An edge-weighting $w$ induces a vertex coloring $f_w: V(G) \to \mathbb{N}$ defined by $f_w(v) = \sum_{v \in e} w(e)$. ... more
Source: Taiwanese Journal of Mathematics
Institutions National Taiwan University, East China Normal University, Thompson Rivers University, National Center for Theoretical Sciences, Shanghai Institute of Computing Technology
Cites: 14
Cited by: 42
Related to: 10
FWCI: 1.66
Citation percentile (by year/subfield): 91.68
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze