Related papers: Williams' and Graded Equivalence Conjectures for s…

We prove Leavitt path algebra versions of the two uniqueness theorems of graph C*-algebras. We use these uniqueness theorems to analyze the ideal structure of Leavitt path algebras and give necessary and sufficient conditions for their…

The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhart quasi-polynomials of polytopes naturally associated to…

A graph $G$ with four or more vertices is called bicritical if the removal of any pair of distinct vertices of $G$ results in a graph with a perfect matching. A bicritical graph is minimal if the deletion of each edge results in a…

C. Thomassen in \cite{[11]} suggested (see also \cite{[2]}, J. C.Bermond, C. Thomassen, Cycles in Digraphs - A survey, J. Graph Theory 5 (1981) 1-43, Conjectures 1.6.7 and 1.6.8) the following conjectures : 1. Every 3-strongly connected…

An ultragraph gives rise to a labelled graph with some particular properties. In this paper we describe the algebras associated to such labelled graphs as groupoid algebras. More precisely, we show that the known groupoid algebra…

We show that for sufficiently large $d$, every balanced bipartite, connected biclaw-free graph with minimum degree $\geq d$ is Hamiltonian. This confirms a conjecture of Flandrin, Fouquet, and Li.

In 1982, Tuza conjectured that the size $\tau(G)$ of a minimum set of edges that intersects every triangle of a graph $G$ is at most twice the size $\nu(G)$ of a maximum set of edge-disjoint triangles of $G$. This conjecture was proved for…

We describe how boundary paths in a graph can be used to construct irreducible representations of the associated graph C*-algebra and the associated Leavitt path algebra. We use this construction to establish two sets of results: First, we…

Adapting a recent work of Brannan et al., on extending graph $C^*$-algebras to Quantum graphs, we introduce "Quantum Quivers" as an analogue of quivers where the edge and vertex set has been replaced by a $C^*$-algebra and the maps between…

Let $\Gamma$ be a connected $G$-vertex-transitive graph, let $v$ be a vertex of $\Gamma$ and let $L=G_v^{\Gamma(v)}$ be the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$. Then…

In this paper, motivated by the Berger, Coburn and Lebow and Bercovici, Douglas and Foias theory for tuples of commuting isometries, we study analytic representations and joint invariant subspaces of a class of commuting $n$-isometries and…

For a graph $G$ the random $n$-lift of $G$ is obtained by replacing each of its vertices by a set of $n$ vertices, and joining a pair of sets by a random matching whenever the corresponding vertices of $G$ are adjacent. We show that…

The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…

Let S $\subseteq$ N be a numerical semigroup with multiplicity m = min(S \ {0}) and conductor c = max(N \ S) + 1. Let P be the set of primitive elements of S, and let L be the set of elements of S which are smaller than c. A longstand-ing…

Nash-Williams' Strong Immersion Conjecture states that graphs are well-quasi-ordered by the strong immersion relation. That is, given infinitely many graphs, one graph contains another graph as a strong immersion. In this paper we study the…

The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…

A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…

Given a connected graph $G=(V,E)$ and a crossing family $\mathcal{C}$ over ground set $V$ such that $|\delta_G(U)|\geq 2$ for every $U\in \mathcal{C}$, we prove there exists a strong orientation of $G$ for $\mathcal{C}$, i.e., an…

Whitney's Theorem states that every graph, different from $K_3$ or $K_{1,3}$, is uniquely determined by its line graph. A $1$-line graph of a multi-graph is the graph with as vertices the edges of the multi-graph, and two edges adjacent if…

We describe a class of $C^*$-algebras which simultaneously generalise the ultragraph algebras of Tomforde and the shift space $C^*$-algebras of Matsumoto. In doing so we shed some new light on the different $C^*$-algebras that may be…