中文
相关论文

相关论文: On distance-regular Cayley graphs of generalized d…

200 篇论文

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…

组合数学 · 数学 2014-01-14 Moharram N. Iradmusa , Cheryl E. Praeger

We define a simple graph as compact if it lacks even cycles and satisfies the odd-cycle condition. Our focus is on classifying all compact graphs and examining the characteristics of their edge rings. Let $G$ be a compact graph and…

交换代数 · 数学 2024-05-08 Zexin Wang , Dancheng Lu

Let $G$ be a group and $S$ an inverse closed subset of $G\setminus \{1\}$. By a Cayley graph $Cay(G,S)$ we mean the graph whose vertex set is the set of elements of $G$ and two vertices $x$ and $y$ are adjacent if $x^{-1}y\in S$. A group…

群论 · 数学 2017-10-13 A. Abdollahi , M. Zallaghi

A subset $R$ of the vertex set of a graph $\Gamma$ is said to be $(\kappa,\tau)$-regular if $R$ induces a $\kappa$-regular subgraph and every vertex outside $R$ is adjacent to exactly $\tau$ vertices in $R$. In particular, if $R$ is a…

组合数学 · 数学 2022-12-06 Junyang Zhang , Yanhong Zhu

We consider the Cayley graph ${\rm C}(W,S)$ of a Coxeter system $(W,S)$ and describe all maximal $2$-cliques in this graph, i.e. maximal subsets in the vertex set such that the distance between any two distinct elements is equal to $2$. As…

组合数学 · 数学 2014-04-29 Mark Pankov

We consider the random Cayley graphs of a sequence of finite nilpotent groups of diverging sizes $G=G(n)$, whose ranks and nilpotency classes are uniformly bounded. For some $k=k(n)$ such that $1\ll\log k \ll \log |G|$, we pick a random set…

概率论 · 数学 2024-03-20 Jonathan Hermon , Xiangying Huang

We prove that random d-regular Cayley graphs of the symmetric group asymptotically almost surely have girth at least (log_{d-1}|G|)^{1/2}/2 and that random d-regular Cayley graphs of simple algebraic groups over F_q asymptotically almost…

概率论 · 数学 2011-11-10 Alex Gamburd , Shlomo Hoory , Mehrdad Shahshahani , Aner Shalev , Balint Virag

The {\it total irregularity} of a simple undirected graph $G$ is defined as ${\rm irr}_t(G) =$ $\frac{1}{2}\sum_{u,v \in V(G)}$ $\left| d_G(u)-d_G(v) \right|$, where $d_G(u)$ denotes the degree of a vertex $u \in V(G)$. Obviously, ${\rm…

离散数学 · 计算机科学 2014-07-07 Hosam Abdo , Darko Dimitrov

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. In this paper we give conditions for when a Cayley graph on an abelian group can be represented as a…

组合数学 · 数学 2022-05-04 Joy Morris , Adrian Skelton

For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a…

组合数学 · 数学 2007-10-08 David J. Grynkiewicz , Oriol Serra , Vsevolod Lev

Let $S, K$ be two subrings of a finite ring $R$. Then the generalized non-commuting graph of subrings $S, K$ of $R$, denoted by $\Gamma_{S, K}$, is a simple graph whose vertex set is $(S \cup K) \setminus (C_K(S) \cup C_S(K))$ and two…

环与代数 · 数学 2016-04-14 Jutirekha Dutta , Dhiren Kumar Basnet , Rajat Kanti Nath

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

群论 · 数学 2024-03-21 Paul-Henry Leemann , Mikael de la Salle

In this paper, we characterize the finite groups $G$ of even order with the property that for any involution $x$ and element $y$ of $G$, $\langle x, y \rangle$ is isomorphic to one of the following groups: $\mathbb{Z}_2,$ $\mathbb{Z}_2^2$,…

群论 · 数学 2021-04-02 Yan-Quan Feng , István Kovács

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

数论 · 数学 2009-05-20 Gyan Prakash

Given a connected graph $G$ with at least three vertices, let $d_G(u,v)$ denote the distance between vertices $u,v\in V(G)$. A subset $S\subseteq V$ is called a doubly resolving set (DRS) of $G$ if for any two distinct vertices $u, v \in…

组合数学 · 数学 2026-01-30 Qingjie Ye

Let $G$ be an undirected graph of order $n$ and let $C_i$ be an $i$-cycle graph. $G$ is called pancyclic if $G$ contains a $C_i$ for any $i\in \{3,4,\ldots,n\}$. We show that the pancyclicity of specific Cayley graphs and the Cartesian…

组合数学 · 数学 2023-09-06 Yusaku Nishimura

Let $S\subset\text{GL}_n(\mathbb Z)$ be a finite symmetric set. We show that if the Zariski closure of $\Gamma=\langle S\rangle$ is a product of $\text{SL}_d$ or a special affine linear group, then the diameter of the Cayley graph…

群论 · 数学 2021-10-05 Lam Pham , Xin Zhang

Let $s$ be a positive integer. Our goal is to find all finite abelian groups $G$ that contain a $2$-subset $A$ for which the undirected Cayley graph $\Gamma(G,A)$ has diameter at most $s$. We provide a complete answer when $G$ is cyclic,…

组合数学 · 数学 2024-12-11 Bela Bajnok , W. Kyle Beatty

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

概率论 · 数学 2021-02-05 Jonathan Hermon , Sam Olesker-Taylor

We show that if G is any nilpotent, finite group, and the commutator subgroup of G is cyclic, then every connected Cayley graph on G has a hamiltonian cycle.

组合数学 · 数学 2011-11-29 Ebrahim Ghaderpour , Dave Witte Morris