English
Related papers

Related papers: Some Algebraic Properties of Sierpi\'nski-Type Gra…

200 papers

A Cayley graph $\Cay(G,S)$ is said to be inner-automorphic if $S$ is a union of conjugacy classes of a group $G$, and arc-transitive if its full automorphism group acts transitively on the set of arcs. In this paper, we characterize four…

Group Theory · Mathematics 2026-04-07 Jun-Jie Huang , Jin-Hua Xie

As a vital link between group theory and graph theory, Cayley graphs provide a geometric framework for encoding algebraic structures. This study explores the properties of Cayley graphs derived from cyclic groups whose order is the square…

Combinatorics · Mathematics 2026-04-28 Iqbal Atmaja , Ahmad Erfanian , Yeni Susanti , Muhammad Nurul Huda , Ari Suparwanto

In the present paper, we study Neumaier Cayley graphs. First, we give a criterion for a Cayley graph to be a Neumaier graph with a spread given by the cosets of a subgroup. Further, we construct a new infinite family of Neumaier Cayley…

Combinatorics · Mathematics 2026-02-24 Rhys J. Evans , Sergey Goryainov , Grigory Ryabov , Da Zhao

In a recent paper, Chernikov and Starchenko prove that graphs defined in distal theories have strong regularity properties, generalizing previous results about graphs defined by semi-algebraic relations. We give a shorter, purely…

Logic · Mathematics 2015-08-18 Pierre Simon

We define special Hamiltonian-paths and special permutations of the up-facing dark tiles on a checked triangular grid related to the generalized Sierpi\'{n}ski Gasket. Our definitions and observations make possible the generalization of the…

Combinatorics · Mathematics 2017-10-25 András Kaszanyitzky

We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…

Functional Analysis · Mathematics 2014-12-03 Matthias Keller , Daniel Lenz , Marcel Schmidt , Radosław K. Wojciechowski

This paper describes a general method for representing $k$-token graphs of Cayley graphs as lifts of voltage graphs. This allows us to construct line graphs of circulant graphs and Johnson graphs as lift graphs on cyclic groups. As an…

Combinatorics · Mathematics 2024-04-03 C. Dalfó , M. A. Fiol , S. Pavlíková , J. Širáň

A subgroup of the automorphism group of a graph acts {\em half-arc-transitively} on the graph if it acts transitively on the vertex-set and on the edge-set of the graph but not on the arc-set of the graph. If the full automorphism group of…

Combinatorics · Mathematics 2024-12-09 Štefko Miklavič , Primož Šparl , Stephen E. Wilson

A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…

Combinatorics · Mathematics 2017-07-18 Da-Wei Yang , Yan-Quan Feng , Jin Ho Kwak , Jaeun Lee

Paley graphs form a nice link between the distribution of quadratic residues and graph theory. These graphs possess remarkable properties which make them useful in several branches of mathematics. Classically, for each prime number $p$ we…

Combinatorics · Mathematics 2023-12-08 Ján Mináč , Lyle Muller , Tung T. Nguyen , Nguyen Duy Tân

We define Leavitt path algebras of hypergraphs generalizing simultaneously Leavitt path algebras of finitely separated graphs and Leavitt path algebras of row-finite vertex-weighted graphs. We find linear bases for those algebras, compute…

Rings and Algebras · Mathematics 2019-02-26 Raimund Preusser

In [Steve Butler. A note about cospectral graphs for the adjacency and normalized Laplacian matrices. Linear Multilinear Algebra, 58(3-4):387-390, 2010.], Butler constructed a family of bipartite graphs, which are cospectral for both the…

Combinatorics · Mathematics 2020-02-04 M. Rajesh Kannan , Shivaramakrishna Pragada

Extending earlier results of Godsil and of Dobson and Malnic on Johnson graphs, we characterise those merged Johnson graphs $J=J(n,k)_I$ which are Cayley graphs, that is, which are connected and have a group of automorphisms acting…

Combinatorics · Mathematics 2015-09-11 Gareth A. Jones , Robert Jajcay

In this paper, we introduce a generalization of corona of graphs. This construction generalizes the generalized corona of graphs (consequently, the corona of graphs), the cluster of graphs, the corona-vertex subdivision graph of graphs and…

Combinatorics · Mathematics 2020-08-13 R. Rajkumar , M. Gayathri

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

Combinatorics · Mathematics 2008-08-12 Benjamin Steinberg

Recently, several works by a number of authors have studied integrality, distance integrality, and distance powers of Cayley graphs over some finite groups, such as dicyclic groups and (generalized) dihedral groups. Our aim is to generalize…

Combinatorics · Mathematics 2022-02-24 Angelot Behajaina , François Legrand

In a recent paper (arXiv:1505.01475 ) Est\'elyi and Pisanski raised a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct an infinite family of trivalent Haar graphs that are…

Group Theory · Mathematics 2016-03-21 Marston Conder , István Estélyi , Tomaž Pisanski

The $\alpha$-Hermitian adjacency matrix $H_\alpha$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number…

Combinatorics · Mathematics 2022-05-26 Omar Alomari , Mohammad Abudayah , Manal Ghanem

We examine the capacity of the complementarity spectrum to distinguish non-isomorphic digraphs. We focus on the seven families with exactly three complementarity eigenvalues. Our findings reveal that in some, but not all families, any two…

Combinatorics · Mathematics 2024-03-19 Diego Bravo , Florencia Cubría , Marcelo Fiori , Gustavo Rama

Let $G_n=\mathbb{Z}_n\times \mathbb{Z}_n$ for $n\geq 4$ and $S=\{(i,0),(0,i),(i,i): 1\leq i \leq n-1\}\subset G_n$. Define $\Gamma(n)$ to be the Cayley graph of $G_n$ with respect to the connecting set $S$. It is known that $\Gamma(n)$ is a…

Combinatorics · Mathematics 2026-03-17 Angsuman Das , S. Morteza Mirafzal