Open Access. Powered by Scholars. Published by Universities.®

Discrete Mathematics and Combinatorics Commons

Open Access. Powered by Scholars. Published by Universities.®

968 Full-Text Articles 1,127 Authors 104,022 Downloads 94 Institutions

All Articles in Discrete Mathematics and Combinatorics

Faceted Search

968 full-text articles. Page 1 of 36.

List-Distinguishing Cartesian Products Of Cliques, Michael Ferrara, Zoltan Füredi, Sogol Jahanbekam, Paul Wenger 2019 University of Colorado, Denver

List-Distinguishing Cartesian Products Of Cliques, Michael Ferrara, Zoltan Füredi, Sogol Jahanbekam, Paul Wenger

Sogol Jahanbekam

The distinguishing number of a graph G, denoted D(G), is the minimum number of colors needed to produce a coloring of the vertices of G so that every nontrivial isomorphism interchanges vertices of different colors. A list assignment L on a graph G is a function that assigns each vertex of G a set of colors. An L-coloring of G is a coloring in which each vertex is colored with a color from L(v). The list distinguishing number of G, denoted Dℓ(G) is the minimum k such that every list assignment L that assigns a list ...


Pascal's Triangle, Pascal's Pyramid, And The Trinomial Triangle, Antonio Saucedo Jr. 2019 California State University, San Bernardino

Pascal's Triangle, Pascal's Pyramid, And The Trinomial Triangle, Antonio Saucedo Jr.

Electronic Theses, Projects, and Dissertations

Many properties have been found hidden in Pascal's triangle. In this paper, we will present several known properties in Pascal's triangle as well as the properties that lift to different extensions of the triangle, namely Pascal's pyramid and the trinomial triangle. We will tailor our interest towards Fermat numbers and the hockey stick property. We will also show the importance of the hockey stick properties by using them to prove a property in the trinomial triangle.


Analogues Between Leibniz's Harmonic Triangle And Pascal's Arithmetic Triangle, Lacey Taylor James 2019 California State University - San Bernardino

Analogues Between Leibniz's Harmonic Triangle And Pascal's Arithmetic Triangle, Lacey Taylor James

Electronic Theses, Projects, and Dissertations

This paper will discuss the analogues between Leibniz's Harmonic Triangle and Pascal's Arithmetic Triangle by utilizing mathematical proving techniques like partial sums, committees, telescoping, mathematical induction and applying George Polya's perspective. The topics presented in this paper will show that Pascal's triangle and Leibniz's triangle both have hockey stick type patterns, patterns of sums within shapes, and have the natural numbers, triangular numbers, tetrahedral numbers, and pentatope numbers hidden within. In addition, this paper will show how Pascal's Arithmetic Triangle can be used to construct Leibniz's Harmonic Triangle and show how both triangles ...


Recent Trends In Combinatorics, Andrew Beveridge, Jerrold R. Griggs, Leslie Hogben, Gregg Musiker, Prasad Tetali 2019 Macalester College

Recent Trends In Combinatorics, Andrew Beveridge, Jerrold R. Griggs, Leslie Hogben, Gregg Musiker, Prasad Tetali

Leslie Hogben

Section 1: Extremal and Probabilistic Combinatorics -- Problems Related to Graph Indices in Trees -- The edit distance in graphs: methods, results and generalizations -- Repetitions in graphs and sequences -- On Some Extremal Problems for Cycles in Graphs -- A survey of Turan problems for expansions -- Survey on matching, packing and Hamilton cycle problems on hypergraphs -- Rainbow Hamilton cycles in random graphs and hypergraphs -- Further applications of the Container Method -- Independent transversals and hypergraph matchings - an elementary approach -- Giant components in random graphs -- Infinite random graphs and properties of metrics -- Nordhaus-Gaddum Problems for Colin de Verdière Type Parameters, Variants of Tree-width, and Related Parameters ...


Minimum Rank, Maximum Nullity, And Zero Forcing Number Of Graphs, Shaun M. Fallat, Leslie Hogben 2019 University of Regina

Minimum Rank, Maximum Nullity, And Zero Forcing Number Of Graphs, Shaun M. Fallat, Leslie Hogben

Leslie Hogben

This chapter represents an overview of research related to a notion of the “rank of a graph" and the dual concept known as the “nullity of a graph," from the point of view of associating a fixed collection of symmetric or Hermitian matrices to a given graph. This topic and related questions have enjoyed a fairly large history within discrete mathematics, and have become very popular among linear algebraists recently, partly based on its connection to certain inverse eigenvalue problems, but also because of the many interesting applications (e.g., to communication complexity in computer science and to control of ...


The Determinant Of A Complex Matrix And Gershgorin Circles, Florian Bünger, Siegfried M. Rump 2019 Hamburg University of Technology

The Determinant Of A Complex Matrix And Gershgorin Circles, Florian Bünger, Siegfried M. Rump

Electronic Journal of Linear Algebra

Each connected component of the Gershgorin circles of a matrix contains exactly as many eigenvalues as circles are involved. Thus, the Minkowski (set) product of all circles contains the determinant if all circles are disjoint. In [S.M. Rump. Bounds for the determinant by Gershgorin circles. Linear Algebra and its Applications, 563:215--219, 2019.], it was proved that statement to be true for real matrices whose circles need not to be disjoint. Moreover, it was asked whether the statement remains true for complex matrices. This note answers that in the affirmative. As a by-product, a parameterization of the outer loop ...


On The Intersection Number Of Finite Groups, Humberto Bautista Serrano 2019 University of Texas at Tyler

On The Intersection Number Of Finite Groups, Humberto Bautista Serrano

Math Theses

Let G be a finite, nontrivial group. In a paper in 1994, Cohn defined the covering number of a finite group as the minimum number of nontrivial proper subgroups whose union is equal to the whole group. This concept has received considerable attention lately, mainly due to the importance of recent discoveries. In this thesis we study a dual concept to the covering number. We define the intersection number of a finite group as the minimum number of maximal subgroups whose intersection is equal to the Frattini subgroup. Similarly we define the inconjugate intersection number of a finite group as ...


Behind The Tiles: Mathematics Of Carcassonne, Emilia DeWyngaert 2019 Merrimack College

Behind The Tiles: Mathematics Of Carcassonne, Emilia Dewyngaert

Across the Bridge: The Merrimack Undergraduate Research Journal

Carcassonne is a tile-placing game where players take turns choosing a tile from a stack and attempting to create a city, road or a meadow. In addition to this, there is a river expansion pack that has river tiles to be placed. This paper focuses on how many different layouts or configurations of the river expansion pack can be created. It also discusses the Matlab code adapted to create a simulation of possible configurations of the river expansion pack.


Vertex And Edge Spread Of Zero Forcing Number, Maximum Nullity, And Minimum Rank Of A Graph, Christina J. Edholm, Leslie Hogben, My Huynh, Josh LaGrange, Darren D. Row 2019 Willamette University

Vertex And Edge Spread Of Zero Forcing Number, Maximum Nullity, And Minimum Rank Of A Graph, Christina J. Edholm, Leslie Hogben, My Huynh, Josh Lagrange, Darren D. Row

Leslie Hogben

The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i not equal j) is nonzero whenever {i, j} is an edge in G and is zero otherwise; maximum nullity is taken over the same set of matrices. The zero forcing number is the minimum size of a zero forcing set of vertices and bounds the maximum nullity from above. The spread of a graph parameter at a vertex v or edge e of G is the difference between the value of the parameter on ...


Maximum Oriented Forcing Number For Complete Graphs, Yair Caro, Ryan Pepper 2019 University of Haifa-Oranim

Maximum Oriented Forcing Number For Complete Graphs, Yair Caro, Ryan Pepper

Theory and Applications of Graphs

The \emph{maximum oriented $k$-forcing number} of a simple graph $G$, written $\MOF_k(G)$, is the maximum \emph{directed $k$-forcing number} among all orientations of $G$. This invariant was recently introduced by Caro, Davila and Pepper in~\cite{CaroDavilaPepper}, and in the current paper we study the special case where $G$ is the complete graph with order $n$, denoted $K_n$. While $\MOF_k(G)$ is an invariant for the underlying simple graph $G$, $\MOF_k(K_n)$ can also be interpreted as an interesting property for tournaments. Our main results further focus on the case when $k=1$. These include a ...


Proof Of A Conjecture Of Graham And Lovasz Concerning Unimodality Of Coefficients Of The Distance Characteristic Polynomial Of A Tree, Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy, Leslie Hogben, Franklin H.J. Kenter, Jephian C.-H. Lin, Michael Tait 2019 Iowa State University

Proof Of A Conjecture Of Graham And Lovasz Concerning Unimodality Of Coefficients Of The Distance Characteristic Polynomial Of A Tree, Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy, Leslie Hogben, Franklin H.J. Kenter, Jephian C.-H. Lin, Michael Tait

Leslie Hogben

The conjecture of Graham and Lov ́asz that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal is proved; it is also shown that the (normalized) coefficients are log-concave. Upper and lower bounds on the location of the peak are established.


Multi-Part Nordhaus-Gaddum Type Problems For Tree-Width, Colin De Verdière Type Parameters, And Hadwiger Number, Leslie Hogben, Jephian C.-H. Lin, Michael Young 2019 Iowa State University and American Institute of Mathematics

Multi-Part Nordhaus-Gaddum Type Problems For Tree-Width, Colin De Verdière Type Parameters, And Hadwiger Number, Leslie Hogben, Jephian C.-H. Lin, Michael Young

Leslie Hogben

A traditional Nordhaus-Gaddum problem for a graph parameter β is to find a (tight) upper or lower bound on the sum or product of β(G)and β(G¯) (where G¯ denotes the complement of G). An r-decomposition G1,…,Gr of the complete graph Kn is a partition of the edges of Kn among r spanning subgraphs G1,…,Gr. A traditional Nordhaus-Gaddum problem can be viewed as the special case for r=2 of a more general r-part sum or product Nordhaus-Gaddum type problem. We determine the values of the r-part sum and product upper bounds asymptotically as n goes ...


Cop Throttling Number: Bounds, Values, And Variants, Anthony Bonato, Jane Breen, Boris Brimkov, Joshua Carlson, Sean English, Jesse Geneson, Leslie Hogben, K. E. Perry, Carolyn Reinhart 2019 Ryerson University

Cop Throttling Number: Bounds, Values, And Variants, Anthony Bonato, Jane Breen, Boris Brimkov, Joshua Carlson, Sean English, Jesse Geneson, Leslie Hogben, K. E. Perry, Carolyn Reinhart

Leslie Hogben

The cop throttling number thc(G) of a graph G for the game of Cops and Robbers is the minimum of k+captk(G), where k is the number of cops and captk(G) is the minimum number of rounds needed for k cops to capture the robber on G over all possible games in which both players play optimally. In this paper, we answer in the negative a question from [Breen et al., Throttling for the game of Cops and Robbers on graphs, {\em Discrete Math.}, 341 (2018) 2418--2430.] about whether the cop throttling number of any graph is ...


Graphs That Are Cospectral For The Distance Laplacian, Boris Brimkov, Ken Duna, Leslie Hogben, Kate Lorenzen, Carolyn Reinhart, Sung-Yell Song, Mark Yarrow 2019 Rice University

Graphs That Are Cospectral For The Distance Laplacian, Boris Brimkov, Ken Duna, Leslie Hogben, Kate Lorenzen, Carolyn Reinhart, Sung-Yell Song, Mark Yarrow

Leslie Hogben

The distance matrix D(G) of a graph G is the matrix containing the pairwise distances between vertices, and the distance Laplacian matrix is DL(G)=T(G)−D(G), where T(G) is the diagonal matrix of row sums of D(G). We establish several general methods for producing DL-cospectral graphs that can be used to construct infinite families. We provide examples showing that various properties are not preserved by DL-cospectrality, including examples of DL-cospectral strongly regular and circulant graphs. We establish that the absolute values of coefficients of the distance Laplacian characteristic polynomial ...


Nordhaus-Gaddum Problems For Colin De Verdière Type Parameters, Variants Of Tree-Width, And Related Parameters, Leslie Hogben 2019 Iowa State University

Nordhaus-Gaddum Problems For Colin De Verdière Type Parameters, Variants Of Tree-Width, And Related Parameters, Leslie Hogben

Leslie Hogben

A Nordhaus-Gaddum problem for a graph parameter is to determine a tight lower or upper bound for the sum or product of the parameter evaluated on a graph and on its complement. This article surveys Nordhaus-Gaddum results for the Colin de Verdiere type parameters mu, nu, and xi; tree-width and its variants largeur d'arborescence, path-width, and proper path-width; and minor monotone ceilings of vertex connectivity and minimum degree.


Spn Graphs And Rank-1 Cp-Completable Graphs, Leslie Hogben, Naomi Shaked-Monderer 2019 Iowa State University

Spn Graphs And Rank-1 Cp-Completable Graphs, Leslie Hogben, Naomi Shaked-Monderer

Leslie Hogben

A simple graph G is an SPN graph if every copositive matrix having graph G is the sum of a positive semidefinite and nonnegative matrix. SPN graphs were introduced in [Shaked-Monderer, SPN graphs: When copositive = SPN, Linear Algebra Appl., 509(15):82-113, 2016], where it was conjectured that the complete subdivision graph of K4 is an SPN graph. We disprove this conjecture, which in conjunction with results in the Shaked-Monderer paper show that a subdivision of K4 is a SPN graph if and only if at most one edge is subdivided. We conjecture that a graph is an SPN graph ...


Zero Forcing And Maximum Nullity For Hypergraphs, Leslie Hogben 2019 Iowa State University and American Institute of Mathematics

Zero Forcing And Maximum Nullity For Hypergraphs, Leslie Hogben

Leslie Hogben

The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way zero forcing was defined as an upper bound for the maximum nullity of the family of symmetric matrices whose nonzero pattern of entries is described by a given graph: A family of symmetric hypermatrices is associated with a uniform hypergraph and zeros are forced in a null vector. The value of the hypergraph zero forcing number and maximum nullity are determined for various families of uniform hypergraphs and the effects of several graph operations on the hypergraph zero forcing number are determined. The ...


The Principal Rank Characteristic Sequence Over Various Fields, Wayne Barrett, Steve Butler, Minerva Catral, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, P. van den Driessche, Michael Young 2019 Brigham Young University

The Principal Rank Characteristic Sequence Over Various Fields, Wayne Barrett, Steve Butler, Minerva Catral, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, P. Van Den Driessche, Michael Young

Leslie Hogben

Given an n x n matrix, its principal rank characteristic sequence is a sequence of length n+1 of 0s and 1s where, for k = 0, 1, . . . , n, a 1 in the kth position indicates the existence of a principal submatrix of rank k and a 0 indicates the absence of such a submatrix. The principal rank characteristic sequences for symmetric matrices over various fields are investigated, with all such attainable sequences determined for all n over any field with characteristic 2. A complete list of attainable sequences for real symmetric matrices of order 7 is reported.


The Inverse Eigenvalue Problem Of A Graph: Multiplicities And Minors, Wayne Barrett, Steve Butler, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Bryan L. Shader, Michael Young 2019 Brigham Young University

The Inverse Eigenvalue Problem Of A Graph: Multiplicities And Minors, Wayne Barrett, Steve Butler, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Bryan L. Shader, Michael Young

Leslie Hogben

The inverse eigenvalue problem of a given graph G is to determine all possible spectra of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in G. Barrett et al. introduced the Strong Spectral Property (SSP) and the Strong Multiplicity Property (SMP) in [8]. In that paper it was shown that if a graph has a matrix with the SSP (or the SMP) then a supergraph has a matrix with the same spectrum (or ordered multiplicity list) augmented with simple eigenvalues if necessary, that is, subgraph monotonicity. In this paper we extend this to a form of minor ...


Rigid Linkages And Partial Zero Forcing, Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan Shader 2019 Texas State University - San Marcos

Rigid Linkages And Partial Zero Forcing, Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan Shader

Leslie Hogben

Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a spanning rigid linkage and thus a vital linkage. A related generalization of zero forcing that produces a rigid linkage via a coloring process is developed. One of the motivations for introducing zero forcing is to provide an upper bound on the maximum multiplicity of an eigenvalue among the real symmetric matrices described by a graph. Rigid linkages and a related ...


Digital Commons powered by bepress