| Summary: | 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 of the graph,then g is defined as a neighbour-distinguishing total labeling of G. For them, there exist two conjectures such as 1,2,3-conjecture (i. e.,every connected graph G≠K2 has a neighbour-distinguishing edge labeling in {1,2,3}) and 1,2-conjecture （i. e.，every simple graph has a neighbour-distinguishing total labeling in {1，2}). This paper shows that 1,2, 3-conjecture and 1, 2-conjecture hold for the edge-multiplicity-paths-replacements for any graph.
|
|---|