Binary vertex labelings of graphs and digraphs
DOI:
https://doi.org/10.13069/jacodesmath.v12i1.305Keywords:
Friendly labeling, Cordial graph, $(2,3)$-cordial digraph, Freyberg-Marr labelingAbstract
A $(0,1)$-labeling of a set is said to be friendly if the number of elements of the set labeled $0$ and the number labeled $1$ differ by at most $1$. Let $g$ be a labeling of the edge set of a graph that is induced by a labeling $f$ of the vertex set. If both $g$ and $f$ are friendly then $f$ is said to be a cordial labeling of the graph. This concept extended to directed graphs is called $(2,3)$-cordiality of digraphs. We investigate the labelings that are both cordial for a graph and $(2,3)$-cordial for an orientation of it. We also consider the same problem for other known binary vertex labelings of graphs.
Received: 28 September 2023 | Accepted: 6 January 2024
Downloads
References
L. B. Beasley, Cordial digraphs, J. Combin. Math. Combin. Comput. 121(1) (2024) 59–66.
I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin. 23 (1987) 201–208.
P. Erdős, A. Rényi, and V. T. Sós, On a problem of graph theory, Studia Sci. Math. Hungar. 1 (1966) 215–235.
W. Q. Erickson, D. Herden, J. Meddaugh, M. R. Sepanski, I. Echols, C. Hammon, J. Marchena-Menendez, J. Mohn, B. Radillo-Murguia, and I. Ruiz-Bolanos, Klein cordial trees and odd cyclic cordial friendship graphs, Discrete Math. 346(9) (2023) 113488.
B. Freyberg and A. Marr, Red-blue colorings of graphs, Conference presentation, 53rd Southeastern International Conference on Combinatorics, Graph Theory & Computing, Florida Atlantic University (2022).
