David E. Brown
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
David E. Brown has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Jonathan M. Mousley
Department of Mathematics and Statistics Department of Mathematics and Statistics Department of Mathematics and Statistics Department of Mathematics and Statistics Utah State University 84322 Logan UT USA
3 shared publications - LeRoy B. Beasley
Utah State University
3 shared publications - Manuel Santana
Department of Mathematics and Statistics Department of Mathematics and Statistics Department of Mathematics and Statistics Department of Mathematics and Statistics Utah State University 84322 Logan UT USA
3 shared publications - Breeann M. Flesch
Columbia University Western Oregon University Willamette University Willamette University University of Oregon
2 shared publications - J. Richard Lundgren
Department of Applied Mathematics, University of Colorado at Denver, Denver, CO 80217, United States
2 shared publications - Larry J. Langley
University of the Pacific
2 shared publications
Latest Publications
- 16 June 2024
- Published by Springer Nature
- p. 129-140
(2, 3)-Cordial Oriented Hypercubes
- Open Access
Dot Product Representations of Graphs Using Tropical Arithmetic
A dot-product representation of a graph is a mapping of its vertices to vectors of length $k$ so that vertices are adjacent if and only if the inner product (a.k.a. dot product) of their corresponding vertices exceeds some threshold. Minimizing dimension of the vector space into which the vectors must be mapped is a typical focus. We investigate this and structural characterizations of graphs whose dot product representations are mappings into the tropical semi-rings of min-plus and max-plus. We also observe that the minimum dimension required to represent a graph using a \emph{tropical representation} is equal to the better-known threshold dimension of the graph; that is, the minimum number of subgraphs that are threshold graphs whose union is the graph being represented.Open AccessDot Product Representations of Graphs Using Tropical Arithmetic
A dot-product representation of a graph is a mapping of its vertices to vectors of length $k$ so that vertices are adjacent if and only if the inner product (a.k.a. dot product) of their corresponding vertices exceeds some threshold. Minimizing dimension of the vector space into which the vectors must be mapped is a typical focus. We investigate this and structural characterizations of graphs whose dot product representations are mappings into the tropical semi-rings of min-plus and max-plus. We also observe that the minimum dimension required to represent a graph using a \emph{tropical representation} is equal to the better-known threshold dimension of the graph; that is, the minimum number of subgraphs that are threshold graphs whose union is the graph being represented. - 19 October 2023
- Published by Springer Nature in Theory of Computing Systems
- Vol. 67 (6) , 1307-1332
Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams
- 19 October 2023
- Published by Springer Nature in Theory of Computing Systems
- Vol. 67 (6) , 1307-1332
Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams
- Open Access
(2,3)-Cordial Oriented Hypercubes
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,3)-cordial oriented hypercubes of dimension not divisible by 3 and state a conjecture on existence for dimension 3k + 1. We close by presenting the only 3D oriented hypercubes up to isomorphism that are not (2,3)-cordial.
Open Access(2,3)-Cordial Oriented Hypercubes
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,3)-cordial oriented hypercubes of dimension not divisible by 3 and state a conjecture on existence for dimension 3k + 1. We close by presenting the only 3D oriented hypercubes up to isomorphism that are not (2,3)-cordial.
- Open Access
- 1 January 2023
- Published by Kutztown University of Pennsylvania in Communications on Number Theory and Combinatorial Theory
- Vol. 4 (1) , 1-7
Combinatorially Orthogonal Paths
Vectors x=(x1,x2,...,xn)T and y=(y1,y2,...,yn)T are combinatorially orthogonal if |{i:xiyi≠0}|≠1. An undirected graph G=(V,E) is a combinatorially orthogonal graph if there exists f:V→ℝn such that for any u,v∈V, uv∉E iff f(u) and f(v) are combinatorially orthogonal. We will show that every graph has a combinatorially orthogonal representation. We will show the bounds for the combinatorially orthogonal dimension of any path Pn.
- 1 January 2023
- Published by Kutztown University of Pennsylvania in Communications on Number Theory and Combinatorial Theory
- Vol. 4 (1) , 1-7
Open AccessCombinatorially Orthogonal Paths
Vectors x=(x1,x2,...,xn)T and y=(y1,y2,...,yn)T are combinatorially orthogonal if |{i:xiyi≠0}|≠1. An undirected graph G=(V,E) is a combinatorially orthogonal graph if there exists f:V→ℝn such that for any u,v∈V, uv∉E iff f(u) and f(v) are combinatorially orthogonal. We will show that every graph has a combinatorially orthogonal representation. We will show the bounds for the combinatorially orthogonal dimension of any path Pn.
- Open Access
(2,3) Cordial Trees and Paths
Recently L. B. Beasley introduced $(2,3)$-cordial labelings of directed graphs in [1]. He made two conjectures which we resolve in this article. He conjectured that every orientation of a path of length at least five is $(2,3)$ cordial, and that every tree of max degree $n =3$ has a cordial orientation. We show these two conjectures to be false. We also discuss the $(2,3)$ cordiality of orientations of the Petersen graph, and establish an upper bound for the number of edges a graph can have and still be $(2,3)$ cordial. An application of $(2,3)$ cordial labelings is also presented.Open Access(2,3) Cordial Trees and Paths
Recently L. B. Beasley introduced $(2,3)$-cordial labelings of directed graphs in [1]. He made two conjectures which we resolve in this article. He conjectured that every orientation of a path of length at least five is $(2,3)$ cordial, and that every tree of max degree $n =3$ has a cordial orientation. We show these two conjectures to be false. We also discuss the $(2,3)$ cordiality of orientations of the Petersen graph, and establish an upper bound for the number of edges a graph can have and still be $(2,3)$ cordial. An application of $(2,3)$ cordial labelings is also presented. - 1 January 2020
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 584, 371-393
Entropy of tournament digraphs
- 1 January 2020
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 584, 371-393
Entropy of tournament digraphs
- 17 November 2017
- Published by Springer Nature in Order
- Vol. 35 (3) , 495-514
Interval k-Graphs and Orders
- 17 November 2017
- Published by Springer Nature in Order
- Vol. 35 (3) , 495-514
Interval k-Graphs and Orders
- Open Access
Interval k-Graphs and Orders
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes. In this paper we discuss the interval $k$-graphs that are the incomparability graphs of orders; i.e., cocomparability interval $k$-graphs or interval $k$-orders. Interval $2$-orders have been characterized in many ways, but we show that analogous characterizations do not carry over to interval $k$-orders, for $k > 2$. We describe the structure of interval $k$-orders, for any $k$, characterize the interval $3$-orders (cocomparability interval $3$-graphs) via one forbidden suborder (subgraph), and state a conjecture for interval $k$-orders (any $k$) that would characterize them via two forbidden suborders.Open AccessInterval k-Graphs and Orders
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes. In this paper we discuss the interval $k$-graphs that are the incomparability graphs of orders; i.e., cocomparability interval $k$-graphs or interval $k$-orders. Interval $2$-orders have been characterized in many ways, but we show that analogous characterizations do not carry over to interval $k$-orders, for $k > 2$. We describe the structure of interval $k$-orders, for any $k$, characterize the interval $3$-orders (cocomparability interval $3$-graphs) via one forbidden suborder (subgraph), and state a conjecture for interval $k$-orders (any $k$) that would characterize them via two forbidden suborders.