7 papers
Dot Product Representations of Graphs Using Tropical Arithmetic
Sean Bailey, David Brown, Michael Snyder +1
A dot-product representation of a graph is a mapping of its vertices to vectors of length so that vertices are adjacent if and only if the inner product (a.k.a. dot product) of…
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…
(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…
(2,3) Cordial Trees and Paths
Manuel Santana, Jonathan Mousley, David Brown +1
Recently L. B. Beasley introduced -cordial labelings of directed graphs in [1]. He made two conjectures which we resolve in this article. He conjectured that every orientati…
Entropy of Tournament Digraphs
David E. Brown, Eric Culver, Bryce Frederickson +2
The Rényi -entropy of complete antisymmetric directed graphs (i.e., tournaments) is explored. We optimize when and , and find that as increases 's…
Interval k-Graphs and Orders
David E. Brown, Breeann M. Flesch, Larry J. Langley
An interval -graph is the intersection graph of a family of intervals of the real line partitioned into at most classes with vertices adjacent if and only if t…
2-connected claw-free chordal graphs are cycle extendable
Deborah Arangno, David E. Brown
A cycle of length in graph is extendable if there is another cycle in with and length . A graph is cycle extendable if every non-Hami…