Results 71 to 80 of about 472 (183)
Discrete Mathematics, 2001 The author considers the Cayley graphs \(\Gamma\) of a group \(G\) which have the property that \(\Aut\Gamma= L(G)R(G)\), where \(L(G)\) and \(R(G)\) denote the left and the right regular representation of \(G\). He proves that this equation holds if and only if \(\Gamma\) is a graphical regular representation of \(G\cong (\mathbb{Z})^n\) \((n> 4)\).
openaire +1 more source
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
Connectivity of addition Cayley graphs
Journal of Combinatorial Theory, Series B, 2009 For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a special, explicitly described form.
David J. Grynkiewicz +2 more
openaire +2 more sources
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
Identifiability of points and rigidity of hypergraphs under algebraic constraints
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank +3 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1979 AbstractBy a result of L. Lovász, the determination of the spectrum of any graph with transitive automorphism group easily reduces to that of some Cayley graph.We derive an expression for the spectrum of the Cayley graph X(G,H) in terms of irreducible characters of the group G: λti,1+…+λti,ni=∑g1,…,gt∈HXiΠs=1tgs for any natural number t, where ξi is an
openaire +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 the Foundational Arguments of Sufficient Dimension Reduction
WIREs Computational Statistics, Volume 18, Issue 2, June 2026.Contemporary Sufficient Dimension Reduction, a versatile method for extracting material information from data, can serve as a preprocessor for classical modeling and inference, or as a standalone theory that leads directly to statistical inference. ABSTRACT Sufficient dimension reduction (SDR) refers to supervised methods of dimension reduction that ...
R. Dennis Cook
wiley +1 more source
European Journal of Combinatorics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources