Abstract
Let G = (V, E) be a graph. A mapping f: E(G) → {0, l}m is called a mod 2 coding of G, if the induced mapping g: V(G) → {0, l}m, defined as \(g(v) = \sum\limits_{u \in V,uv \in E} {f(uv)}\), assigns different vectors to the vertices of G. Note that all summations are mod 2. Let m(G) be the smallest number m for which a mod 2 coding of G is possible. Trivially, m(G) ≥ ⌈Log2 |V|⌉. Recently, Aigner and Triesch proved that m(G) ≤ ⌈Log2 |V|⌉ + 4. In this paper, we determine m(G). More specifically, we prove that if each component of G has at least three vertices, then
where k = ⌈Log2 |V|⌉.
Similar content being viewed by others
References
Aigner, M., Triesch, E.: Codings of graphs with binary labels. Graphs and Combinatorics 10, 1–10 (1994)
Aigner, M., Triesch, E.: Irregular assignments of trees and forests. SIAM J. Discrete Math. 3, 439–449 (1990)
Aigner, M., Triesch, E.: Irregular assignments and two problems a la Ringel. In: R. Bodendieck and R. Hems: Topics in Combinatorics and Graph Theory. Physics Verlag, 29–36 (1990)
Golomb, S.W.: How to number a graph. In: R.C. Read: Graph theory and computing. Academic Press, 23–37 (1972)
Ringel, G.: Problem No. 25. In: M. Fiedler: Theory of graphs and its applications. Proc. Symp. Smolenice 1963. Publ. House Czech. Acad. Sciences 1964
Tuza, Z.: Encoding the vertices of a graph with binary edge-labels. In: R.M. Capocelli: Sequences combinatorics, compression, security and transmission. Berlin Heidelberg New York: Springer-Verlag, 287–299 (1990)
Tuza, Z.: Zero-sum block design and graph labelings. J. Comb. Design 3, 89–99 (1995)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Caccetta, L., Jia, RZ. Binary Labeling of Graphs. Graphs and Combinatorics 13, 119–137 (1997). https://doi.org/10.1007/BF03352990
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03352990