Picard groups of tensor categories play an important role in rational conformal field theory. The Picard group of the representation category C of a rational vertex algebra can be used to construct examples of (symmetric special) Frobenius algebras...
Ply number is a recently developed graph drawing metric inspired by studying road networks. Informally, for each vertex v, which is associated with a point in the plane, a disk is drawn centered on v with a radius that is alpha times the length of th...
Fullerenes are molecules in the form of cage-like polyhedra, consisting solely of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of a vertex $v$ of a graph is the sum of distances from $v$ to all the o...
In 2023, Moore and Singh used the theory of orbifold vertex operator algebras to explicitly construct an $\mathcal{N} = 1$ supercurrent in the Beauty and the Beast module of Dixon, Ginsparg, and Harvey. Using their techniques, we show that $\mathcal{...
We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an {\bf out-colouring}. The problem of deciding whether a given digraph has an out-colouring with only two colours (called a 2-out-colourin...
We present a branch and bound method for maximizing an arbitrary set function h mapping 2^V to R. By decomposing h as f-g, where f is a submodular function and g is the cut function of a (simple, undirected) graph G with vertex set V, our original...
Let $G$ be a graph with nonnegative integer weights. A {\it unit acquisition move} transfers one unit of weight from a vertex to a neighbor that has at least as much weight. The {\it unit acquisition number} of a graph $G$, denoted $a_u(G)$, is the m...
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be equivalent. One o...
Two simple $n$-vertex graphs $G_{1}$ and $G_{2}$, with respective maximum degrees $Δ_{1}$ and $Δ_{2}$, are said to pack if $G_{1}$ is isomorphic to a subgraph of the complement of $G_{2}$. The BEC conjecture by Bollobás, Eldridge, and Catlin, stat...
In 2018, forts were defined as non-empty subsets of vertices in a graph where no vertex outside the set has exactly one neighbor in the set. Forts have since been used to characterize zero forcing sets, model zero forcing as an integer program, and p...
In 2018, a fort of a graph was introduced as a non-empty subset of vertices in which no vertex outside of the set has exactly one neighbor in the set. Since then, forts have been used to characterize zero forcing sets, model the zero forcing number a...
The edit distance between two graphs on the same vertex set is defined to be size of the symmetric difference of their edge sets. The edit distance function of a hereditary property, $\mathcal{H}$, is a function of $p$ and measures, asymptotically, t...
In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph $G$ with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-' edges cut...
Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The clean gra...
Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The clean gra...
Let $G$ be a connected graph. A vertex $w\in V(G)$ strongly resolves two vertices $u,v\in V(G)$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric generator for...
We present GRIP, a graph neural network accelerator architecture designed for low-latency inference. AcceleratingGNNs is challenging because they combine two distinct types of computation: arithmetic-intensive vertex-centric operations and memory-int...
We prove that $χ(G) \leq \max {ω(G), Δ_2(G), (5/6)(Δ(G) + 1)}$ for every graph $G$ with $Δ(G) \geq 3$. Here $Δ_2$ is the parameter introduced by Stacho that gives the largest degree that a vertex $v$ can have subject to the condition that $v$ i...
The triangle-degree of a vertex v of a simple graph G is the number of triangles in G that contain v. A simple graph is triangle-distinct if all its vertices have distinct triangle-degrees. Berikkyzy et al. [Discrete Math. 347 (2024) 113695] recently...
With the emerging of 360-degree image/video, augmented reality (AR) and virtual reality (VR), the demand for analysing and processing spherical signals get tremendous increase. However, plenty of effort paid on planar signals that projected from sphe...