Zobrazeno 1 - 10
of 181
pro vyhledávání: '"Beasley, LeRoy B."'
Autor:
Beasley, LeRoy b.
An undirected graph is said to be cordial if there is a friendly (0,1)-labeling of the vertices that induces a friendly (0,1)-labeling of the edges. An undirected graph $G$ is said to be $(2,3)$-orientable if there exists a friendly (0,1)-labeling of
Externí odkaz:
http://arxiv.org/abs/2408.13853
Autor:
Beasley, LeRoy B.
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 b
Externí odkaz:
http://arxiv.org/abs/2212.05142
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 hypercube for any dimension divisible by 3. Next, we provide examples of (2
Externí odkaz:
http://arxiv.org/abs/2012.11091
Autor:
Song, Seok-Zun, Beasley, LeRoy B.
Publikováno v:
Linear & Multilinear Algebra; Jul2024, Vol. 72 Issue 10, p1612-1624, 13p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Beasley, LeRoy B., Song, Seok-Zun
Publikováno v:
In Linear Algebra and Its Applications 15 February 2016 491:263-275
Publikováno v:
In Journal of Algebra 1 July 2015 433:168-182