Related papers: Certain graphs with exactly one irreducible $T$-mo…

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension of $\Gamma$ is the smallest size of…

The concept of pseudo-distance-regularity around a vertex of a graph is a natural generalization, for non-regular graphs, of the standard distance-regularity around a vertex. In this note, we prove that a pseudo-distance-regular graph…

Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph $\Gamma_s(G)$ of $G$ is a graph with vertex set $G\setminus Sol(G)$ and two distinct vertices $u$ and $v$ are adjacent if and only if $\langle u, v…

The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…

Let $V_{L}$ be the vertex algebra associated to a non-degenerate even lattice $L$, $\theta$ the automorphism of $V_{L}$ induced from the $-1$ symmetry of $L$, and $V_{L}^{+}$ the fixed point subalgebra of $V_{L}$ under the action of…

Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…

Let $G$ be a connected semisimple Lie group with finite center. Let $\Gamma \subset G$ be a discrete subgroup. We study closed admissible irreducible subrepresentations of the space of distributions $\mathcal S(\Gamma \backslash G)'$…

Let $\Gamma$ denote a distance-regular graph with classical parameters $(D,b,\alpha,\beta)$ and $b\not=1$, $\alpha=b-1$. The condition on $\alpha$ implies that $\Gamma$ is formally self-dual. For $b=q^2$ we use the adjacency matrix and dual…

Let $M$ be a left $R$-module. We define the \emph{homomorphism submodule graph} $\Gamma_{\mathrm{Hom}}(M)$ as the simple graph whose vertices are the proper submodules of $M$, with an edge between distinct vertices $N_1$ and $N_2$ if and…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

Let $\Gamma$ be a dual polar graph with diameter $D \geqslant 3$, having as vertices the maximal isotropic subspaces of a finite-dimensional vector space over the finite field $\mathbb{F}_q$ equipped with a non-degenerate form (alternating,…

When $\Gamma$ is a row-finite di(rected )graph we classify all finite dimensional modules of the Leavitt path algebra $L(\Gamma)$ via an explicit Morita equivalence given by an effective combinatorial (reduction) algorithm on the digraph…

Let $\Gamma$ denote a bipartite graph with vertex set $X$, color partitions $Y$, $Y'$, and assume that every vertex in $Y$ has eccentricity $D\ge 3$. For $z\in X$ and a non-negative integer $i$, let $\Gamma_{i}(z)$ denote the set of…

The Gruenberg-Kegel graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$…

Let $A$ be a connected commutative $\C$-algebra with derivation $D$, $G$ a finite linear automorphism group of $A$ which preserves $D$, and $R=A^G$ the fixed point subalgebra of $A$ under the action of $G$. We show that if $A$ is generated…

For a finite connected simple graph, the Terwilliger algebra is a matrix algebra generated by the adjacency matrix and idempotents corresponding to the distance partition with respect to a fixed vertex. We will consider algebras defined by…

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also…

Let $X$ be an algebraic surface with $\mathcal{L}$ an ample line bundle on $X$. Let $\Gamma(X, \mathcal{L})$ be the \emph{geometric monodromy} group associated to family of nonsingular curves in $X$ that are zero loci of sections of…