Results 81 to 90 of about 589,042 (217)
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
Enumeration of Triangles in a Divisor Cayley Graph [PDF]
, 2013 In this paper a new class of arithmetic Cayley graphs, namely, divisor Cayley graphs associated with the divisor function d ƒvnƒw , n „d1,an integer is introduced. It is shown that this graph is regular, hamiltonian, connected and not bipartite, and when
Madhavi, L +2 more
core +1 more source
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
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
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
Proper 3‐realizability and second cohomology of groups on two generators of finite order
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract Given an (infinite) finitely generated group G$G$, its first cohomology group H1(G;ZG)$H^1(G;{\mathbb {Z}}G)$ is free abelian and “counts” the number of ends of G$G$ which equals 1+rank(H1(G;ZG))$1 + rank (H^1(G;{\mathbb {Z}}G))$. The question whether or not for every finitely presented group G$G$ its second cohomology group H2(G;ZG)$H^2(G ...
Francisco F. Lasheras, R. Roy
wiley +1 more source
CoRRProceedings of the Third Learning on Graphs Conference (LoG 2024), PMLR 269.
JJ Wilson +2 more
openaire +4 more sources
The Zarankiewicz problem on tripartite graphs
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract In 1975, Bollobás, Erdős, and Szemerédi asked for the smallest τ$\tau$ such that an n×n×n$n \times n \times n$ tripartite graph with minimum degree n+τ$n + \tau$ must contain Kt,t,t$K_{t, t, t}$, conjecturing that τ=O(n1/2)$\tau = \mathcal {O}(n^{1/2})$ for t=2$t = 2$.
Francesco Di Braccio +1 more
wiley +1 more source
METODE PEMBUKTIAN TEOREMA CAYLEY PADA TEORI GRAPH [PDF]
, 2009 This article describes two methods to prove Cayley Theorem in Graph Theory, through 1-1 corespondence between labelled tree - sequence and through Combinatorial Theory.
Abdullah, Abdul Wahab
core