English
Related papers

Related papers: Directed Strongly Regular Cayley Graphs on Dihedra…

200 papers

Lin, Lu, and Yau formulated the Ricci curvature of edges in simple undirected graphs[2]. Using their formulations, we calculate the Ricci curvatures of Cayley graphs for the dihedral groups, the general quaternion groups, and cyclic groups…

Combinatorics · Mathematics 2024-01-17 Iwao Mizukai , Akifumi Sako

Let $G$ be a finite group. We show that if $|G| = pqrs$, where $p$, $q$, $r$, and $s$ are distinct odd primes, then every connected Cayley graph on $G$ has a hamiltonian cycle.

Combinatorics · Mathematics 2021-08-02 Dave Witte Morris

We introduce a family of graphs that generalises the class of Cayley graphs. For non-empty subsets L, R of a group G, the two-sided Cayley graph 2SC(G;L,R) is the directed graph with vertex set G and an arc from x to y if and only if…

Combinatorics · Mathematics 2014-01-14 Moharram N. Iradmusa , Cheryl E. Praeger

We construct a new family of strongly regular graphs with the same parameters as the strongly regular graphs $D_{5,5}(q)$. The construction can be seen as a variant of the construction of twisted Grassmann graphs by Van Dam and Koolen.

Combinatorics · Mathematics 2024-01-12 Ferdinand Ihringer

The present work is devoted to characterize the family of symmetric undirected Cayley graphs over finite Abelian groups for degrees 4 and 6.

Combinatorics · Mathematics 2014-03-31 Cristóbal Camarero , Carmen Martínez , Ramón Beivide

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

Discrete Mathematics · Computer Science 2018-03-26 Didier Caucal

A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \in V(D) \setminus S$ has an adjacent vertex $v$ in $S$ with $v$ directed to $u$. The directed domination number of $D$, denoted by…

Combinatorics · Mathematics 2010-10-13 Yair Caro , Michael A. Henning

We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group $\C{A}$. Using these characterizations, we find degree distribution polynomials for weak equivalence of some graphs including 1) circulant graphs…

Combinatorics · Mathematics 2014-02-18 Dongseok Kim , Young Soo Kwon , Jaeun Lee

We apply spectral analysis of quotients of the Bruhat-Tits buildings of type $\tilde{A}_{d-1}$ to construct isospectral non-isomorphic Cayley graphs of the finite simple groups $\operatorname{PSL}_d({\mathbb F}_q)$ for every $d \geq 5$ ($d…

Combinatorics · Mathematics 2007-05-23 Alexander Lubotzky , Beth Samuels , Uzi Vishne

Divisible design digraphs which can be obtained as Cayley digraphs are studied. A characterization of divisible design Cayley digraphs in terms of the generating sets is given. Further, we give several constructions of divisible design…

Combinatorics · Mathematics 2019-10-25 Dean Crnkovic , Hadi Kharaghani , Andrea Svob

We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we…

Combinatorics · Mathematics 2022-12-01 Daniel R. Hawtin , Cheryl E. Praeger , Jin-Xin Zhou

Let $X=GD$ be a group, where $G$ is a nonabelian simple group and $D$ is a dihedral group. These groups $X$ are closely related to regular Cayley maps. The main theorems of this paper describes $X$.

Combinatorics · Mathematics 2026-05-06 Hao Yu

Let $\Sigma=(\Gamma, \sigma)$ is a signed graph(or sigraph in short), where $\Gamma$ is a underlying graph of $\Sigma$ and $\sigma:E\longrightarrow \{+, -\}$ is a function. Consider $\Gamma=Cay(\mathbb{Z}_{p_{1}}\times…

Combinatorics · Mathematics 2020-11-12 Mohammad A. Iranmanesh , Nasrin Moghaddami

We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.

Group Theory · Mathematics 2019-02-28 Olga Varghese

We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including…

Combinatorics · Mathematics 2019-01-31 Gary R. W. Greaves , Leonard H. Soicher

A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. A non-abelian group is called an inner-abelian group if all of its proper subgroups are…

Combinatorics · Mathematics 2017-01-05 Yan-Li Qin , Jin-Xin Zhou

Directed acyclic graphs (DAGs) can be characterised as directed graphs whose strongly connected components are isolated vertices. Using this restriction on the strong components, we discover that when $m = cn$, where $m$ is the number of…

Combinatorics · Mathematics 2020-04-21 Élie de Panafieu , Sergey Dovgal

We study the distribution of the sandpile group of random d-regular graphs. For the directed model, we prove that it follows the Cohen-Lenstra heuristics, that is, the limiting probability that the $p$-Sylow subgroup of the sandpile group…

Combinatorics · Mathematics 2020-11-11 András Mészáros

In this paper we explicitly determine all indicators for groups isomorphic to the semidirect product of two cyclic groups by an automorphism of prime order, as well as the generalized quaternion groups. We then compute the indicators for…

Representation Theory · Mathematics 2010-04-13 Marc Keilberg

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…

Group Theory · Mathematics 2009-05-08 M. J. Dunwoody
‹ Prev 1 4 5 6 7 8 10 Next ›