English
Related papers

Related papers: Distance-regular Cayley graphs over dicyclic group…

200 papers

It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…

Combinatorics · Mathematics 2016-07-12 Yan-Quan Feng , Klavdija Kutnar , Dragan Marusic , Da-Wei Yang

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

A study of triangulations of cycles in the Cayley diagrams of finitely generated groups leads to a new geometric characterization of hyperbolic groups.

Group Theory · Mathematics 2008-02-03 Robert H. Gilman

We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of type B_3(q) induced on the vertices far from a fixed point, and the subgraph of the dual polar graph of type D_4(q) induced on the vertices…

Combinatorics · Mathematics 2012-04-24 Andries E. Brouwer , Dmitrii V. Pasechnik

A Cayley graph is said to be an NNN-graph if it is both normal and non-normal for isomorphic regular groups, and a group has the NNN-property if there exists an NNN-graph for it. In this paper we investigate the NNN-property of cyclic…

Combinatorics · Mathematics 2019-08-26 Michael Giudici , Luke Morgan , Yian Xu

This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…

Group Theory · Mathematics 2024-08-30 Shafiq ur Rehman , Raheela Tahir , Farhat Noor

We consider Cayley sum graphs over the cyclic group $\mathbb{Z}_n$ and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these graphs. Specifically, we examine various cases for the…

Combinatorics · Mathematics 2025-10-24 Masoumeh Koohestani , Doost Ali Mojdeh , Mohsen Ghasemi

For a graph $\Gamma=(V(\Gamma),E(\Gamma))$, a subset $C$ of $V(\Gamma)$ is called an $(\alpha,\beta)$-regular set in $\Gamma$, if every vertex of $C$ is adjacent to exactly $\alpha$ vertices of $C$ and every vertex of $V(\Gamma)\setminus C$…

Combinatorics · Mathematics 2025-10-02 Meiqi Peng , Yuefeng Yang

For a simple graph $G$, the $3$-distance graph, $D_3(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $3$ in the graph $G$. For a connected graph $G$, we provide some conditions for…

Combinatorics · Mathematics 2024-03-12 S. R. Musawi , S. H. Jafari

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

For a finite group $G$ and subset $S$ of $G,$ the Haar graph $H(G,S)$ is a bipartite regular graph, defined as a regular $G$-cover of a dipole with $|S|$ parallel arcs labelled by elements of $S$. If $G$ is an abelian group, then $H(G,S)$…

Group Theory · Mathematics 2015-05-07 István Estélyi , Tomaž Pisanski

A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…

Combinatorics · Mathematics 2024-10-02 So Hirata

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…

Computational Geometry · Computer Science 2023-08-22 Oswin Aichholzer , Birgit Vogtenhuber , Alexandra Weinberger

From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs or graphs called multidimensional circulants, which turn out to be Cayley (di)graphs of Abelian groups. This paper is mainly devoted to show…

Combinatorics · Mathematics 2012-09-25 M. A. Fiol

We investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.

Group Theory · Mathematics 2025-03-20 Marjory Mwanza

In this paper, we classify reflexible regular Cayley maps for dihedral groups.

Combinatorics · Mathematics 2015-04-22 István Kovács , Young Soo Kwon

In this paper, generalized Cayley graphs are studied. It is proved that every generalized Cayley graph of order 2p is a Cayley graph, where p is a prime. Special attention is given to generalized Cayley graphs on Abelian groups. It is…

Combinatorics · Mathematics 2015-12-02 Ademir Hujdurović , Klavdija Kutnar , Pawel Petecki , Anastasiya Tanana

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…

Logic · Mathematics 2016-02-25 Artem Chernikov , Sergei Starchenko

Cayley graphs are graphs on algebraic structures, typically groups or group-like structures. In this paper, we have obtained a few results on Cayley graphs on Cyclic groups, powers of cycles, Cayley graphs on some non-abelian groups, and…

Combinatorics · Mathematics 2023-08-23 Prajnanaswaroopa S

We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle…

Discrete Mathematics · Computer Science 2016-09-28 Didier Caucal
‹ Prev 1 3 4 5 6 7 10 Next ›