Related papers: On 3-equivalenced weakly distance-regular digraphs
We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
A quasi-strongly regular graph of grade $p$ with parameters $(n, k, a; c_1, \ldots, c_p)$ is a $k$-regular graph of order $n$ such that any two adjacent vertices share $a$ common neighbours and any two non-adjacent vertices share $c_{i}$…
Properties of the `$k$-equivalent' graph families constructed in Cai, F\"{u}rer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive $k$-dim WL method. An extension to the recursive $k$-dim WL method is…
We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…
In this article we prove that all the inclusions between the 'classical' and naturally defined full triangulated subcategories of a weakly approximable triangulated category are intrinsic (in one case under a technical condition). This…
We prove weak approximation for isotrivial families of rationally connected varieties defined over the function field of a smooth projective complex curve.
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…
In 2013, Chan classified all metric hyperelliptic graphs, proving that divisorial gonality and geometric gonality are equivalent in the hyperelliptic case. We show that such a classification extends to combinatorial graphs of divisorial…
Call a hereditary family $\mathcal{F}$ of graphs strongly persistent if there exists a graphon $W$ such that in all subgraphons $W'$ of $W$, $\mathcal{F}$ is precisely the class of finite graphs that have positive density in $W'$. Our first…
A normally regular digraph with parameters $(v,k,\lambda,\mu)$ is a directed graph on $v$ vertices whose adjacency matrix $A$ satisfies the equation $AA^t=k I+\lambda (A+A^t)+\mu(J-I-A-A^t)$. This means that every vertex has out-degree $k$,…
We study the structure of weakly-closed nonself-adjoint algebras arising from representations of single vertex 2-graphs. These are the algebras generated by 2 isometric tuples which satisfy a certain commutation relation. We show that these…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
In a signed graph $G$, an induced subgraph is called a negative clique if it is a complete graph and all of its edges are negative. In this paper, we give the characteristic polynomials and the eigenvalues of some signed graphs having…
We focus on strongly connected, strong for short, digraphs since in this setting distance is defined for every pair of vertices. Distance ideals generalize the spectrum and Smith normal form of several distance matrices associated with…
Weak unit disk contact graphs are graphs that admit representing nodes as a collection of internally disjoint unit disks whose boundaries touch if there is an edge between the corresponding nodes. In this work we focus on graphs without…
Thomassen showed that planar graphs are 5-list-colourable, and that planar graphs of girth at least five are 3-list-colourable. An easy degeneracy argument shows that planar graphs of girth at least four are 4-list-colourable. In 2022,…
Let $f:X\times Y\times Z\longrightarrow W $ be a bounded tri-linear map on normed spaces. We say that $f$ is close-to-regular when $f^{t****s}=f^{s****t}$ and we say that $f$ is completely regular when all natural extensions are equal. In…
We study the simplicial coalgebra of chains on a simplicial set with respect to three notions of weak equivalence. To this end, we construct three model structures on the category of reduced simplicial sets for any commutative ring R. The…
In this paper, we define weakly coherent rings, and examine the transfer of these rings to homomorphic image, trivial ring extension, localization, and direct product. These results provide examples of weakly coherent rings that are not…