3 papers
math.CO2022
Cordial Digraphs
LeRoy B. Beasley
A -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 be a labeling of the edge se…
math.CO2021
Cordiality of Digraphs
Leroy Beasley, David Brown, Jonathan Mousley +1
A -labelling of a set is said to be {\em friendly} if approximately one half the elements of the set are labelled 0 and one half labelled 1. Let be a labelling of the ed…
math.CO2020
(2,3)-Cordial Oriented Hypercubes
Jonathan M. Mousley, Manuel A. Santana, LeRoy B. Beasley +1
In this article we investigate the existence of (2,3)-cordial labelings of oriented hypercubes. In this investigation, we determine that there exists a (2,3)-cordial oriented hyper…