Results 81 to 90 of about 420,658 (213)
Perfect Codes in Cayley Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2018 This is the final version that will appear in SIAM J.
He Huang, Binzhou Xia, Sanming Zhou
openaire +3 more sources
Sensitivity and Hamming Graphs
Journal of Graph Theory, Volume 112, Issue 3, Page 296-305, July 2026.ABSTRACT For any m ≥ 3 we show that the Hamming graph H ( n , m ) admits an imbalanced partition into m sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong m‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio +3 more
wiley +1 more source
, 2005 We will discuss three ways to bound the chromatic number on a Cayley graph. 1. If the connection set contains information about a smaller graph, then these two graphs are related.
Chu, Lei
core
, 2021 Amaç: Bu tez çalışması Öklid grubunun bölüm uzayı kompakt olan alt gruplarının Cayley çizgelerini belirlemek amacı ile yapılmıştır. Materyal ve Yöntem: Cayley çizgeleri yönlü çizgelerdir ve bir grubun Cayley çizgesi üreteç kümesine bağlıdır.
Demirci, Berna
core
Perfect state transfer in unitary Cayley graphs over local rings [PDF]
Transactions on Combinatorics, 2014 In this work, using eigenvalues and eigenvectors of unitary Cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing PST occurring in its unitary Cayley graph.
Yotsanan Meemark , Songpon Sriwongsa
doaj
Color Energy Of A Unitary Cayley Graph
Discussiones Mathematicae Graph Theory, 2014 Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al.
Adiga Chandrashekar +2 more
doaj +1 more source
On the Unitary Cayley Graph of a Ring [PDF]
The Electronic Journal of Combinatorics, 2012 Let $R$ be a ring with identity. The unitary Cayley graph of a ring $R$, denoted by $G_{R}$, is the graph, whose vertex set is $R$, and in which $\{x,y\}$ is an edge if and only if $x-y$ is a unit of $R$. In this paper we find chromatic, clique and independence number of $G_{R}$, where $R$ is a finite ring.
Dariush Kiani, Mohsen Molla Haji Aghaei
openaire +3 more sources
Maximum Induced Trees and Forests of Bounded Degree in Random Graphs
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT The asymptotic behavior of the maximum sizes of induced trees and forests has been studied extensively in the last few decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: (1) We prove 2‐point concentration of the maximum sizes of an induced forest and an induced tree with maximum ...
Margarita Akhmejanova +2 more
wiley +1 more source
Edge-Transitivity of Cayley Graphs Generated by Transpositions
Discussiones Mathematicae Graph Theory, 2016 Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph of S is defined to be the graph with vertex set {1, . . . , n}, and with vertices i and j being adjacent in T(S) whenever (i, j) ∈ S. In the present note,
Ganesan Ashwin
doaj +1 more source
On Isomorphisms of Finite Cayley Graphs
European Journal of Combinatorics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marston D. E. Conder, Cai Heng Li
openaire +1 more source