关于边-多重路替换图的1，2，3-猜想和1，2-猜想(1,2,3-conjecture and 1,2-conjecture for the edge-multiplicity-paths-replacements)

关于边-多重路替换图的1，2，3-猜想和1，2-猜想(1,2,3-conjecture and 1,2-conjecture for the edge-multiplicity-paths-replacements)

Let f:E(G)→Z+ be an edge-weighting (labeing) of a graph G. For each v∈V(G) ， if yields a proper coloring of the graph, then f is defined as a neighbour-distinguishing edge labeling of G. Let g: V(G) ∪ E(G)→Z+ be a total-weighting (labeing) of a graph G. For each v∈ V(G)，if yields a proper coloring...

Full description

Bibliographic Details
Main Authors: LYUDamei(吕大梅), LINWensong(林文松)
Format: Article
Language:zho
Published: Zhejiang University Press 2016-11-01
Series:Zhejiang Daxue xuebao. Lixue ban
Subjects:
1,2 ,3-conjecture
1,2-conjecture
edge-path-replacement
Online Access:https://doi.org/10.3785/j.issn.1008-9497.2016.06.007

Similar Items

Similar Items