English
Related papers

Related papers: On the classification of triply-transitive strongl…

200 papers

For a graph $G=(V,E)$, a set $S \subseteq V$ is a $[1,2]$-set if it is a dominating set for $G$ and each vertex $v \in V \setminus S$ is dominated by at most two vertices of $S$, i.e. $1 \leq \vert N(v) \cap S \vert \leq 2$. Moreover a set…

Discrete Mathematics · Computer Science 2017-07-21 P. Sharifani , M. R. Hooshmandasl

Given a graph $\Gamma = (V, E)$ on $n$ vertices and $m$ edges, we define the Erd\H{o}s-R\'{e}nyi graph process with host $\Gamma$ as follows. A permutation $e_1,\dots,e_m$ of $E$ is chosen uniformly at random, and for $t\leq m$ we let…

Combinatorics · Mathematics 2018-11-09 Tony Johansson

We investigate the tracial and ideal structures of $C^*$-algebras of quasi-regular representations of stabilizers of boundary actions. Our main tool is the notion of boundary maps, namely $\Gamma$-equivariant unital completely positive maps…

Operator Algebras · Mathematics 2021-10-15 Mehrdad Kalantar , Eduardo Scarparo

The complete transposition graph is defined to be the graph whose vertices are the elements of the symmetric group $S_n$, and two vertices $\alpha$ and $\beta$ are adjacent in this graph iff there is some transposition $(i,j)$ such that…

Combinatorics · Mathematics 2015-12-11 Ashwin Ganesan

Let $r\geq 3$ be an integer and $G$ be a graph. Let $\delta(G), \Delta(G)$, $\alpha(G)$ and $\mu(G)$ denotes minimum degree, maximum degree, independence number and matching number of $G$, respectively. Recently, Caro, Davila and Pepper…

Combinatorics · Mathematics 2020-01-08 Hongliang Lu , Xixuan yang

Let $\omega$ be a weight function defined on a locally compact group $G$, $1\le p<+\infty$, $S\subset G$ and let us assume that for any $s\in S$, the left translation operator $T_s$ is continuous from the weighted $L^p$-space…

Functional Analysis · Mathematics 2021-01-06 Arafat Abbar , Yulia Kuznetsova

A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…

Combinatorics · Mathematics 2019-11-13 Heather A. Newman , Hector Miranda , Darren A. Narayan

Let $(\Omega, \leq)$ be a totally ordered set. We prove that if Aut$(\Omega,\leq)$ is transitive and satisfies the same first-order sentences as the automorphism group of the real line (in the language of groups) then $\Omega$ and and the…

Group Theory · Mathematics 2017-01-26 A. M. W. Glass , John S. Wilson

We are concerned with sequences of graphs having a grid geometry, with a uniform local structure in a bounded domain $\Omega\subset {\mathbb R}^d$, $d\ge 1$. We assume $\Omega$ to be Lebesgue measurable with regular boundary and contained,…

Numerical Analysis · Mathematics 2020-09-14 Andrea Adriani , Davide Bianchi , Stefano Serra-Capizzano

We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let $\Gamma$ be a graph with vertex set $V$, diameter $D$, adjacency matrix $A$, and…

Combinatorics · Mathematics 2015-08-18 V. Diego , M. A. Fiol

Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $\Gamma_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include…

Combinatorics · Mathematics 2025-11-19 Sauvik Poddar , Sucharita Biswas , Angsuman Das

Terwilliger algebras are a subalgebra of a matrix algebra constructed from an association scheme. In 2010, Tanaka defined what it means for a Terwilliger algebra to be almost commutative and gave five equivalent conditions for a Terwilliger…

Representation Theory · Mathematics 2025-09-22 Nicholas L. Bastian , Stephen P. Humphries

We give necessary and sufficient conditions for lobe-transitivity of locally finite and locally countable graphs whose connectivity equals 1. We show further that, given any biconnected graph $\Lambda$ and a "code" assigned to each orbit of…

Combinatorics · Mathematics 2018-12-03 Jack E. Graver , Mark E. Watkins

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

Group Theory · Mathematics 2024-12-05 Yunsong Gan , Weijun Liu , Binzhou Xia

A graph $G=(V,E)$ is $\gamma$-excellent if $V$ is a union of all $\gamma$-sets of $G$, where $\gamma$ stands for the domination number. Let $\mathcal{I}$ be a set of all mutually nonisomorphic graphs and $\emptyset \not= \mathcal{H}…

Combinatorics · Mathematics 2020-10-08 Vladimir Samodivkin

We give a natural definition for the transitivity of a matrix. Using an endomorphism d of a base ring R and a transitive nxn matrix over the center Z(R), we construct the subalgebra M_{n}(R,d,T) of the full nxn matrix algebra M_{n}(R)…

Rings and Algebras · Mathematics 2014-10-29 Jeno Szigeti

Let $G$ be a complex connected reductive algebraic group that acts on a smooth complex algebraic variety $X$, and let $E$ be a $G$-equivariant algebraic vector bundle over $X$. A section of $E$ is regular if it is transversal to the zero…

Algebraic Topology · Mathematics 2021-05-06 Alexey Gorinov , Nikolay Konovalov

A subgroup of the automorphism group of a graph $\G$ is said to be {\em half-arc-transitive} on $\G$ if its action on $\G$ is transitive on the vertex set of $\G$ and on the edge set of $\G$ but not on the arc set of $\G$. Tetravalent…

Combinatorics · Mathematics 2023-06-05 Iva Antončič , Primož Šparl

Let $\Gamma$ be a graph with diameter at least two. Then $\Gamma$ is said to be $1$-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices $x$ and $y$ in $\Gamma$, the distance partition of the vertex set of…

Combinatorics · Mathematics 2026-01-15 Jack H. Koolen , Mamoon Abdullah , Brhane Gebremichel , Jae-Ho Lee

Let $\Gamma=\mathrm{Cay}(G,S)$ be a Cayley digraph on a group $G$ and let $A=\mathrm{Aut}(\Gamma)$. The Cayley index of $\Gamma$ is $|A:G|$. It has previously been shown that, if $p$ is a prime, $G$ is a cyclic $p$-group and $A$ contains a…

Combinatorics · Mathematics 2017-03-08 Luke Morgan , Joy Morris , Gabriel Verret
‹ Prev 1 8 9 10 Next ›