Results 51 to 60 of about 20,494 (188)
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
Journal of Graph Theory, EarlyView.ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) $G=(V,E)$ is said to be ( X , Y ) $(X,Y)$‐embeddable if any set of induced edge lengths from an ...
Sean Dewar +3 more
wiley +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Cayley Graphs Defined by Systems of Equations
Axioms, 2022 Let R be a finite ring. In this paper, we mainly explore the conditions to ensure the graph BΓn defined by a system of equations {fi|i=2,…,n} to be a Cayley graph or a Hamiltonian graph.
Fuyuan Yang +3 more
doaj +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Acylindrical group actions on quasi-trees
, 2016 A group G is acylindrically hyperbolic if it admits a non-elementary acylindrical action on a hyperbolic space. We prove that every acylindrically hyperbolic group G has a generating set X such that the corresponding Cayley graph is a (non-elementary ...
Balasubramanya, Sahana
core +1 more source
Coloring minimal Cayley graphs
European Journal of Combinatorics9 pages, 1 ...
García Marco, Ignacio, Knauer, Kolja
openaire +4 more sources
Strongly Regular Semi-Cayley Graphs [PDF]
Journal of Algebraic Combinatorics, 1992 This paper studies strongly regular graphs \(G\) on \(2n\) vertices which admit a group of automorphisms \(\Gamma\) of order \(n\) with two orbits of length \(n\) on the vertices of \(G\), which are called semi-Cayley graphs. The Petersen and Hoffman-Singleton graphs provide examples.
de Resmini, Marialuisa J. +1 more
openaire +3 more sources
Consistent Quadratic Phase Formation in 3D Fast Spin Echo Using Frequency‐Modulated RF Pulses
Magnetic Resonance in Medicine, EarlyView.ABSTRACT Purpose Frequency‐modulated (FM) RF pulses achieve broadband excitation with low RF peak power, which is required in MRI with inhomogeneous magnetic fields. However, the quadratic phase generated with FM pulses makes it difficult to use them in fast spin echo (FSE), because even and odd refocused echoes have different spatial phase profiles ...
Naoharu Kobayashi, Michael Garwood
wiley +1 more source
Distance Powers and Distance Matrices of Integral Cayley Graphs over Abelian Groups [PDF]
, 2012 It is shown that distance powers of an integral Cayley graph over an abelian group are again integral Cayley graphs over that group. Moreover, it is proved that distance matrices of integral Cayley graphs over abelian groups have integral ...
Klotz, W., Sander, T.
core
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