On weak majority dimensions of digraphs
Combinatorics
2019-03-26 v1
Abstract
In this paper, we introduce the notion of the weak majority dimension of a digraph which is well-defined for any digraph. We first study properties shared by the weak dimension of a digraph and show that a weak majority dimension of a digraph can be arbitrarily large. Then we present a complete characterization of digraphs of weak majority dimension and , respectively, and show that every digraph with weak majority dimension at most two is transitive. Finally, we compute the weak majority dimensions of directed paths and directed cycles and pose open problems.
Keywords
Cite
@article{arxiv.1903.09933,
title = {On weak majority dimensions of digraphs},
author = {Soogang Eoh and Suh-Ryung Kim},
journal= {arXiv preprint arXiv:1903.09933},
year = {2019}
}