University of Lethbridge

In this talk I will present a study on the Gromov's hyperbolicity of some product of graphs. The presentation is based on joint works that studied hyperbolicity of the lexicographic product, tensor product and graph join of two graphs, respectively...

Associating graphs with groups date back to Arthur Cayley. In this lecture, we will discuss about another graph, called co-maximal subgroup graph Γ( G) introduced by Akbari et al. in [1]. The co-maximal subgroup graph Γ( G) of a group G whose...

Let G be a finite group acting transitively on X. We say g, h ∈ G are intersecting if gh -1 fixes a point in X . A subset S of G is said to be an intersecting set if every pair of elements in S intersect. Cosets of point stabilizers are canonical...

The workshop builds on the success of the previous Prairie Discrete Math Workshops, from the first one organized by Shaun Fallat and Brian Alspach and held at the University of Regina in Regina, Saskatchewan, in early October 2003, through the most...

In recent years, quantum information theory (QIT) has become a melting pot between disparate branches of physics. Within the last decade, tools and techniques from QIT are bringing new perspectives into fields such as quantum field theory (QFT) and...

In pursuit-evasion games, a set of pursuers attempts to locate, eliminate, or contain an evader in a network. The rules, specified from the outset, greatly determine the difficulty of the questions posed above. For example, the evader may be visible...

A directed graph H consists of a set V(H) of vertices together with a subset A(H) of V(H)×V(H) which are called arcs. A hamiltonian dipath in a digraph is a dipath that visits each vertex exactly once. The Cartesian product H 1◻H 2 of two digraphs H...

Shortcut graphs are graphs in which long enough cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly broad family of graphs and groups of...

Harary and Sabidussi were the first to study the automorphisms of repeated graphs using the wreath product. Later Hemminger would go on to provide necessary and sufficient conditions for these of repeated automorphisms through the introduction of...

In this talk, we introduce the notions of matching matrices in groups and vector spaces, which lead to some necessary conditions for existence of acyclic matching in abelian groups and its linear analogue. We also discuss the linear local matching...