English
Related papers

Related papers: Generalized Cayley graphs and perfect code

200 papers

In this paper the structure of the Cayley graphs and G-graphs of some gyro-groups are studied and some properties of them will be proved. Moreover we review some special gyro-groups including: gyro-commutative gyrogroups, dihedral…

Combinatorics · Mathematics 2024-05-01 Neda Moradi , Gholam Hossein Fath-Tabara , Alain Bretto

Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theory, linear programming and combinatorial optimization. Claude Berge made a conjecture about them, that was proved by Chudnovsky, Robertson,…

Combinatorics · Mathematics 2015-05-25 Nicolas Trotignon

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

Combinatorics · Mathematics 2024-01-30 Asamin Khaefi , Zeinab Akhlaghi , Behrooz Khosravi

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

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

Frank Harary introduced the concepts of sum and integral sum graphs. A graph $G$ is a \textit{sum graph} if the vertices of $G$ can be labeled with distinct positive integers so that $e = uv$ is an edge of $G$ if and only if the sum of the…

Combinatorics · Mathematics 2024-07-16 Lowell W. Beineke , V. Vilfred Kamalappan

Graph colorings are becoming an increasingly useful family of mathematical models for a broad range of applications, such as time tabling and scheduling, frequency assignment, register allocation, computer security and so on. Graph proper…

Combinatorics · Mathematics 2016-01-06 Bing Yao , Ming Yao , Xiang-en Chen

We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain…

Group Theory · Mathematics 2016-10-31 Amrita Acharyya , Jon M. Corson , Bikash Das

Let $\Z_n[i]$ be the ring of Gaussian integers modulo a positive integer $n$. Very recently, Camarero and Mart\'{i}nez [IEEE Trans. Inform. Theory, {\bf 62} (2016), 1183--1192], showed that for every prime number $p>5$ such that $p\equiv…

Information Theory · Computer Science 2020-10-13 Khodakhast Bibak , Bruce M. Kapron , Venkatesh Srinivasan

We study the unitary Cayley graph of a matrix semiring. We find bounds for its diameter, clique number and independence number, and determine its girth. We also find the relationship between the diameter and the clique number of a unitary…

Rings and Algebras · Mathematics 2023-11-15 David Dolžan

We classify the planar cubic Cayley graphs of connectivity 2, providing an explicit presentation and embedding for each of them. Combined with [9] this yields a complete description of all planar cubic Cayley graphs.

Group Theory · Mathematics 2015-03-18 Agelos Georgakopoulos

Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…

General Mathematics · Mathematics 2019-05-31 Robert Haas

In the present paper, complete designs of graphs are considered. The notion of (regular) sampling is introduced and analyzed in detail, showing that the trivial necessary condition for its existence is actually sufficient. Some examples are…

Combinatorics · Mathematics 2012-10-10 L. Giuzzi , A. Pasotti

This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…

Commutative Algebra · Mathematics 2024-01-15 Anuvinda J , Ranjana Mehta , Kamalesh Saha

The Doob graph $D(m,n)$ is the Cartesian product of $m>0$ copies of the Shrikhande graph and $n$ copies of the complete graph of order $4$. Naturally, $D(m,n)$ can be represented as a Cayley graph on the additive group $(Z_4^2)^m \times…

Information Theory · Computer Science 2019-07-02 Minjia Shi , Daitao Huang , Denis S. Krotov

In this paper, we study self-complementary distance-regular Cayley graphs over abelian groups. We prove that if a regular graph is self-complementary distance-regular, then it is self-complementary strongly regular. We also deal with…

Combinatorics · Mathematics 2023-01-18 Mojtaba Jazaeri

In $2006$, Danielsen and Parker \cite{DP} proved that every self-dual additive code over $GF(4)$ is equivalent to a graph code. So, graph is an important tool for searching (proposed) optimum codes. In this paper, we introduce a new method…

Combinatorics · Mathematics 2014-04-01 Ruihu Li , Xueliang Li , Yaping Mao , Meiqin Wei

As a main result of this paper we give conditions under which the generalized $X$-join of Cayley graphs is a Cayley graph. In particular, we show that $X$-join of isomorphic Cayley graphs is a Cayley grpah. To do this, new properties for a…

Combinatorics · Mathematics 2022-03-16 Allen Herman , Javad Bagherian , Hanieh Memarzadeh

Recently, several works by a number of authors have provided characterizations of integral undirected Cayley graphs over generalized dihedral groups and generalized dicyclic groups. We generalize and unify these results in two different…

Combinatorics · Mathematics 2023-06-26 Angelot Behajaina , François Legrand

In this article we complete the work of enumerating typical abelian coverings of Cayley graphs, by reducing the problem to enumerating certain subgroups of finite abelian groups.

Combinatorics · Mathematics 2024-02-27 Haimiao Chen
‹ Prev 1 4 5 6 7 8 10 Next ›