Results 51 to 60 of about 472 (183)
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
Journal of Graph Theory, Volume 112, Issue 4, Page 491-506, August 2026.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 ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar +3 more
wiley +1 more source
Consistent Quadratic Phase Formation in 3D Fast Spin Echo Using Frequency‐Modulated RF Pulses
Magnetic Resonance in Medicine, Volume 96, Issue 2, Page 666-681, August 2026.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
Ars Mathematica Contemporanea35 pages, 2 ...
Árnadóttir, Arnbjörg Soffía +4 more
openaire +3 more sources
On a Ramsey–Turán variant of Roth's theorem
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić +4 more
wiley +1 more source
Vertex-transitive generalized Cayley graphs which are not Cayley graphs
European Journal of Combinatorics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ademir Hujdurovic +2 more
openaire +1 more source
Discrete Analysis, 2017 Quasirandom Cayley graphs, Discrete Analysis 2017:6, 14 pp. An extremely important phenomenon in extremal combinatorics is that of _quasirandomness_: for many combinatorial structures, it is possible to identify a list of deterministic properties, each ...
David Conlon, Yufei Zhao
doaj +1 more source
Groups with a finite Busemann boundary are virtually cyclic
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract This note is a continuation of the study of the relationship between the geometry of Cayley graphs and the size of its metric‐functional boundary. We show that if there exists a Cayley graph with finitely many Busemann points, then the underlying group is virtually cyclic.
Corentin Bodart +2 more
wiley +1 more source
Journal of Combinatorial Designs, Volume 34, Issue 7, Page 306-329, July 2026.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) in PG ( 7 , q 3 ). We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) with T ( q 3 , q ). Then, we provide conditions on a set of lines ℒ, which ensure that ℒ forms the line set of a naturally embedded ...
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
Electronic Notes in Discrete Mathematics, 2000 Abstract In this paper we investigate the class of Cayley partitionable graphs. This investigation is motivated by the Strong Perfect Graph Conjecture. Cayley partitionable graphs are Cayley Graphs which are closely related to near-factorizations of finite groups. We prove some structural properties of near-factorizations and give examples of Cayley
openaire +1 more source
Constructing Independent Spanning Trees on Pancake Networks
IEEE Access, 2020 For any graph G, the set of independent spanning trees (ISTs) is defined as the set of spanning trees in G. All ISTs have the same root, paths from the root to another vertex between distinct trees are vertex-disjoint and edge-disjoint.
Dun-Wei Cheng +2 more
doaj +1 more source