English
Related papers

Related papers: Lifting Constructions of Strongly Regular Cayley G…

200 papers

Recent work in hypergraph Ramsey theory has involved the introduction of a "lifting map" that associates a certain $3$-uniform hypergraph to a given graph, bounding cliques in a predictable way. In this paper, we interpret the lifting map…

Combinatorics · Mathematics 2020-12-29 Mark Budden , Josh Hiller , Tommy Meek , Andrew Penland

We present a construction of Neumaier graphs with nexus 1, which generalises two known constructions of Neumaier graphs. We also use W. Wang, L. Qiu, and Y. Hu switching to show that we construct cospectral Neumaier graphs. Finally, we show…

Combinatorics · Mathematics 2023-02-14 Rhys J. Evans , Sergey Goryainov , Elena V. Konstantinova , Alexander D. Mednykh

Complex unit gain graphs may exhibit various kinds of symmetry. In this work, we explore structural symmetry, spectral symmetry and sign-symmetry in such graphs, and their respective relations to one-another. Our main result is a…

Combinatorics · Mathematics 2024-10-04 Pepijn Wissing , Edwin R. van Dam

The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…

Combinatorics · Mathematics 2025-02-14 Xiongfeng Zhan , Xueyi Huang , Lu Lu

This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…

Group Theory · Mathematics 2010-03-05 Bernhard Krön

It is known that random 2-lifts of graphs give rise to expander graphs. We present a new conjectured derandomization of this construction based on certain Mealy automata. We verify that these graphs have polylogarithmic diameter, and…

Combinatorics · Mathematics 2014-07-18 Anton Malyshev , Igor Pak

We show that the large Cartesian powers of any graph have log-concave valencies with respect to a ffxed vertex. We show that the series of valencies of distance regular graphs is log-concave, thus improving on a result of (Taylor,…

Combinatorics · Mathematics 2025-01-22 Minjia Shi , Lu Wang , Patrick Sole

We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…

Group Theory · Mathematics 2007-05-23 Martin Kassabov

Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not…

Data Structures and Algorithms · Computer Science 2018-04-25 Md. Zamilur Rahman , Asish Mukhopadhyay , Yash P. Aneja

We construct liftings of reduction maps from CM points to supersingular points for general quaternion algebras and use these liftings to establish a precise correspondence between CM points on indefinite quaternion algebras with a given…

Number Theory · Mathematics 2018-01-12 Christophe Cornut , Dimitar Jetchev

A Cayley hyper-digraph is a directed hypergraph that its automorphism group contains a subgroup acting regularly on vertices and a Cayley hypermap is a hypermap whose automorphism group contains a subgroup which induces regular action on…

Combinatorics · Mathematics 2025-04-28 Kai Yuan , Yan Wang

In this paper, we construct directed strongly regular graphs and divisible design graphs with new parameters merging some basic relations of so-called Tatra associations schemes. We also study the above association schemes, their fusions…

Combinatorics · Mathematics 2026-01-19 Mikhail Muzychuk , Grigory Ryabov

In this paper, firstly, we provide some necessary and sufficient conditions for generalized Cayley graphs on abelian groups to be bipartite. Secondly, we deduce several necessary and sufficient conditions for generalized Cayley graphs on…

Combinatorics · Mathematics 2024-12-18 Liao Qianfen , Liu Weijun , Zhang Pengli

In classical homotopy theory, two spaces are homotopy equivalent if one space can be continuously deformed into the other. This theory, however, does not respect the discrete nature of graphs. For this reason, a discrete homotopy theory…

Combinatorics · Mathematics 2022-09-12 Rachel Hardeman Morrill

We define the Cayley graph and its growth function for multivalued groups. We prove that if we change a finite set of generators of multivalued group, or change the starting point, we get an equivalent growth function. We prove that if we…

Group Theory · Mathematics 2025-05-27 Valeriy G. Bardakov , Tatyana A. Kozlovskaya , Matvei N. Zonov

The unitary Cayley graph $C_R$ of a finite unital ring $R$ is the simple graph with vertex set $R$ in which two elements $x$ and $y$ are connected by an edge if and only if $x-y$ is a unit of $R$. We characterize the unitary Cayley graph…

Combinatorics · Mathematics 2024-03-22 Waldemar Hołubowski , Sergiy Kozerenko , Bogdana Oliynyk , Viktoriia Solomko

In this paper we present a method for constructing directed strongly regular graphs with assumed action of an automorphism group. The application of this method leads to first examples of directed strongly regular graphs with parameters…

Combinatorics · Mathematics 2024-12-23 Marija Maksimović , Sanja Rukavina

Abelian Cayley digraphs can be constructed by using a generalization to $Z^n$ of the concept of congruence in $Z$. Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, have…

Combinatorics · Mathematics 2015-02-11 F. Aguiló , M. A. Fiol , S. Pérez

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 investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type characterization in the case of monoids. We then correct a proof of…

Combinatorics · Mathematics 2021-10-07 Kolja Knauer , Gil Puig i Surroca
‹ Prev 1 4 5 6 7 8 10 Next ›