Cordial Digraphs
Combinatorics
2022-12-13 v1
Abstract
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 set of a graph that is induced by a labeling of the vertex set. If both and are friendly then is said to be a cordial labeling of the graph. We extend this concept to directed graphs and investigate the cordiality of directed graphs. We show that all directed paths and all directed cycles are cordial. We also discuss the cordiality of oriented trees and other digraphs.
Keywords
Cite
@article{arxiv.2212.05142,
title = {Cordial Digraphs},
author = {LeRoy B. Beasley},
journal= {arXiv preprint arXiv:2212.05142},
year = {2022}
}