Results 91 to 100 of about 589,042 (217)
On the Eigenvalue Spectrum of Cayley Graphs: Connections to Group Structure and Expander Properties
MathematicsCayley graphs sit at the intersection of algebra, geometry, and theoretical computer science. Their spectra encode fine structural information about both the underlying group and the graph itself.
Mohamed A. Abd Elgawad +4 more
doaj +1 more source
Discrete Applied Mathematics, 1997 Given a quasigroup \(Q\) with a right identity element and a right-associative generating subset \(S\), a quasi-Cayley graph \(\text{QC}(Q,S)\) is constructed in very much the same way as a Cayley graph is constructed from a given group and a symmetric generating set.
openaire +2 more sources
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
A note on the k-degree Cayley graph [PDF]
The k-degree Cayley graph has been proposed by Hsieh and Hsiao (Networks 47 (2006), 26-36). They have shown that the k-degree Cayley graph is actually a Cayley graph.
Tanaka, Yuuki, Shibata, Yukio
core +1 more source
Classification of 14-Valent 1-Regular Core-Free Cayley Graphs
MathematicsA Cayley graph Σ=Cay(G,S) is called 1-regular core-free if G is core-free in some Y⩽AutΣ and AutΣ acts regularly on the set of 1-arcs of Σ. In this paper, we classify the 14-valent 1-regular core-free Cayley graphs.
Liting Yang, Yali Li
doaj +1 more source
L(2, 1)-Labeling of Circulant Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one.
Mitra Sarbari, Bhoumik Soumya
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 +3 more sources
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
Genus of total graphs from rings: A survey
AKCE International Journal of Graphs and Combinatorics, 2018 Let R be a commutative ring. The total graph T Γ ( R ) of R is the undirected graph with vertex set R and two distinct vertices x and y are adjacent if x + y is a zero divisor in R . In this paper, we present a survey of results on the genus of T Γ ( R )
T. Tamizh Chelvam, T. Asir
doaj +1 more source