University of Newcastle Australia

output

19922026

most citedWhen to adjust alpha during multiple testing: A consideration of disjunction, conjunction, and individual testing

385 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

35 papers · 1 filter

math.CO2023★ 1 cited

Cubic factor-invariant graphs of cycle quotient type -- the alternating case

Brian Alspach, Primoz Sparl

We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$ -factor $C$ and a $1$ -factor that is invariant under a vertex-transiti…

math.CO2021

The super-connectivity of Kneser graph KG(n,3)

Yulan Chen, Yuqing Lin, Weigen Yan

A vertex cut $S$ of a connected graph $G$ is a subset of vertices of $G$ whose deletion makes $G$ disconnected. A super vertex cut $S$ of a connected graph $G$ is a subset of verti…

math.CO2020★ 1 cited

Some adjacency-invariant spaces on products of short cycles

Jeffrey A. Hogan, Joseph D. Lakey

We study certain spaces of vertex functions on the Cayley graphs corresponding to N-fold products of the group of integers modulo m, where m=3, 4, or 5, that are invariant under th…

math.CO2020★ 8 cited

Honeycomb Toroidal Graphs

Brian Alspach

Honeycomb toroidal graphs are trivalent Cayley graphs on generalized dihedral groups. We examine the two historical threads leading to these graphs, some of the properties that hav…

math.CO2020

Some graph theoretical aspects of generalized truncations

Brian Alspach, Joshua B. Connor

A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.

math.CO2020

An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs

C. Dalfó, M. A. Fiol, N. López +1

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maxim…

math.CO2019★ 1 cited

Feasible bases for a polytope related to the Hamilton cycle problem

Thomas Kalinowski, Sogol Mohammadian

We study a certain polytope depending on a graph $G$ and a parameter $β \in (0, 1)$ which arises from embedding the Hamiltonian cycle problem in a discounted Markov decision process.…

math.CO2018

(Di)graph decompositions and magic type labelings: a dual relation

S. C. López, F. A. Muntaner-Batle, M. Prabu

A graph $G$ is called edge-magic if there is a bijective function $f$ from the set of vertices and edges to the set ${1, 2, \dots, ∣ V (G) ∣ + ∣ E (G) ∣}$ such that the sum $f(x)+f(xy)+f(y…

math.CO2018★ 2 cited

Hamiltonian cycles and subsets of discounted occupational measures

Ali Eshragh, Jerzy A. Filar, Thomas Kalinowski +1

We study a certain polytope arising from embedding the Hamiltonian cycle problem in a discounted Markov decision process. The Hamiltonian cycle problem can be reduced to finding pa…

math.CO2017★ 5 cited

Zero forcing in iterated line digraphs

Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen

Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced…

math.CO2017

New constructions for the $n$ -queens problem

Martin Bača, Susana-Clara López, Francesc-Antoni Muntaner-Batle +1

Let $D$ be a digraph, possibly with loops. A queen labeling of $D$ is a bijective function $l : V (G) ⟶ {1, 2, \dots, ∣ V (G) ∣}$ such that, for every pair of arcs in $E (D)$ …

math.CO2016★ 1 cited

An algebraic approach to lifts of digraphs

C. Dalfó, M. A. Fiol, M. Miller +2

We study the relationship between two key concepts in the theory of (di)graphs: the quotient digraph, and the lift $Γ^{α}$ of a base (voltage) digraph. These techniques contract or e…

math.CO2016★ 36 cited

A lower bound on the zero forcing number

Randy Davila, Thomas Kalinowski, Sudeep Stephen

In this note, we study a dynamic vertex coloring for a graph $G$ . In particular, one starts with a certain set of vertices black, and all other vertices white. Then, at each time s…

math.CO2016★ 6 cited

Minimum rank and zero forcing number for butterfly networks

Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski +2

The minimum rank of a simple graph $G$ is the smallest possible rank over all symmetric real matrices $A$ whose nonzero off-diagonal entries correspond to the edges of $G$ . Using t…

math.CO2015★ 2 cited

A Family of Dense Mixed Graphs of Diameter $2$

Gabriela Araujo-Pardo, Camino Balbuena, M. Miller +1

A mixed graph is said to be dense if its order is close to the Moore bound and it is optimal if there is not a mixed graph with the same parameters and bigger order. We present a c…

math.CO2015★ 1 cited

Chromatic properties of the Euclidean plane

James D. Currie, Roger B. Eggleton

Let $G$ be the unit distance graph in the plane. A well-known problem in combinatorial geometry is that of determining the chromatic number of $G$ . It is known that $4\le χ(G)\le 7…

math.CO2015★ 22 cited

A revised Moore bound for mixed graphs

Dominique Buset, Mourad El Amiri, Grahame Erskine +2

The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible v…

math.CO2015

Distance labelings: a generalization of Langford sequences

S. C. López, F. A. Muntaner-Batle

A Langford sequence of order $m$ and defect $d$ can be identified with a labeling of the vertices of a path of order $2 m$ in which each labeled from $d$ up to $d + m - 1$ appears twice…

math.CO2014★ 6 cited

Langford sequences and a product of digraphs

Susana-Clara López, Francesc-Antoni Muntaner-Batle

Skolem and Langford sequences and their many generalizations have applications in numerous areas. The $\otimes_{h}$ -product is a generalization of the direct product of digraphs. In…

math.CO2014★ 3 cited

Minimum Weight Resolving Sets of Grid Graphs

Patrick Andersen, Cyriac Grigorious, Mirka Miller

For a simple graph $G = (V, E)$ and for a pair of vertices $u, v \in V$ , we say that a vertex $w \in V$ resolves $u$ and $v$ if the shortest path from $w$ to $u$ is of a different leng…

math.CO2014★ 1 cited

Rainbow eulerian multidigraphs and the product of cycles

Susana-Clara López, Francesc-Antoni Muntaner-Batle

An arc colored eulerian multidigraph with $l$ colors is rainbow eulerian if there is an eulerian circuit in which a sequence of $l$ colors repeats. The digraph product that refers…

math.CO2013★ 1 cited

Connectivity and other invariants of generalized products of graphs

S. C. López, F. A. Muntaner-Batle

Figueroa-Centeno et al. introduced the following product of digraphs: let $D$ be a digraph and let $Γ$ be a family of digraphs such that $V (F) = V$ for every $F \in Γ$ . Consider any f…

math.CO2013★ 1 cited

Constructions of Large Graphs on Surfaces

Ramiro Feria-Puron, Guillermo Pineda-Villavicencio

We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface $Σ$ and integers $Δ$ and $k$ , determine the maximum order $N (Δ, k, Σ)$ of a graph em…

math.CO2012★ 9 cited

Lower bounds on maximal determinants of +-1 matrices via the probabilistic method

Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith

We show that the maximal determinant D(n) for $n \times n$ $\pm 1$ -matrices satisfies $R (n) := D (n) / n^{n /2} \geq κ_{d} > 0$ . Here $n^{n /2}$ is the Hadamard upper bound, and $κ_{d}$ de…

Cubic factor-invariant graphs of cycle quotient type -- the alternating case

The super-connectivity of Kneser graph KG(n,3)

Some adjacency-invariant spaces on products of short cycles

Honeycomb Toroidal Graphs

Some graph theoretical aspects of generalized truncations

An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs

Feasible bases for a polytope related to the Hamilton cycle problem

(Di)graph decompositions and magic type labelings: a dual relation

Hamiltonian cycles and subsets of discounted occupational measures

Zero forcing in iterated line digraphs

New constructions for the n-queens problem

An algebraic approach to lifts of digraphs

A lower bound on the zero forcing number

Minimum rank and zero forcing number for butterfly networks

A Family of Dense Mixed Graphs of Diameter 2

Chromatic properties of the Euclidean plane

A revised Moore bound for mixed graphs

Distance labelings: a generalization of Langford sequences

Langford sequences and a product of digraphs

Minimum Weight Resolving Sets of Grid Graphs

Rainbow eulerian multidigraphs and the product of cycles

Connectivity and other invariants of generalized products of graphs

Constructions of Large Graphs on Surfaces

Lower bounds on maximal determinants of +-1 matrices via the probabilistic method

New constructions for the $n$ -queens problem

A Family of Dense Mixed Graphs of Diameter $2$