On {a, b}-Edge-Weightings of Bipartite Graphs with Odd a, b
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}-e...
Main Authors: | Bensmail Julien, Inerney Fionn Mc, Lyngsie Kasper Szabo |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2250 |
Similar Items
-
An Oriented Version of the 1-2-3 Conjecture
by: Baudon Olivier, et al.
Published: (2015-02-01) -
The bipartite Laplacian matrix of a nonsingular tree
by: Bapat Ravindra B., et al.
Published: (2023-08-01) -
Another View of Bipartite Ramsey Numbers
by: Bi Zhenming, et al.
Published: (2018-05-01) -
Equimatchable Bipartite Graphs
by: Büyükçolak Yasemin, et al.
Published: (2023-02-01) -
Decomposition of Certain Complete Bipartite Graphs into Prisms
by: Froncek Dalibor
Published: (2017-02-01)