On {a, b}-Edge-Weightings of Bipartite Graphs with Odd a, b

Discussiones Mathematicae Graph Theory

Lyngsie Kasper Szabo¹  Bensmail Julien²  Inerney Fionn Mc² 

[1] Technical University of Denmark;Université Côte d’Azur, CNRS, Inria, I3S, France;

关键词: neighbour-sum-distinguishing edge-weightings;    bipartite graphs;    odd weights;    1-2-3 conjecture;    05c15;    05c22;   

DOI  :  10.7151/dmgt.2250

来源: DOAJ

【 摘 要 】

For any S ⊂ ℤ we say that a graph G has the S-property if there exists an S-edge-weighting w : E(G) → S such that for any pair of adjacent vertices u, v we have ∑e∈E(v) w(e) ≠ ∑e∈E(u) w(e), where E(v) and E(u) are the sets of edges incident to v and u, respectively. This work focuses on {a, a + 2}-edge-weightings where a ∈ ℤ is odd. We show that a 2-connected bipartite graph has the {a, a + 2}-property if and only if it is not a so-called odd multi-cactus. In the case of trees, we show that only one case is pathological. That is, we show that all trees have the {a, a + 2}-property for odd a ≠ −1, while there is an easy characterization of trees without the {−1, 1}-property.

【 授权许可】

Unknown