Results 11 to 20 of about 994,076 (215)

Consistent Quadratic Phase Formation in 3D Fast Spin Echo Using Frequency-Modulated RF Pulses. [PDF]

open access: yesMagn Reson Med
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 ...
Kobayashi N, Garwood M.
europepmc   +2 more sources

Cayley and Tutte polytopes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun's conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected graphs.
Matjaž Konvalinka, Igor Pak
doaj   +1 more source

Domination in Cayley graphs: A survey

open access: yesAKCE International Journal of Graphs and Combinatorics, 2019
Let Ω be a symmetric generating set of a finite group Γ. Assume that (Γ,Ω)be such that Γ=〈Ω〉and Ω satisfies the two conditions C1: the identity element e∉Ω and C2: if a∈Ω, then a−1∈Ω. Given (Γ,Ω)satisfying C1and C2, define a Cayley graph G=Cay(Γ,Ω)with V(
T. Tamizh Chelvam, M. Sivagami
doaj   +2 more sources

Cayley graph on symmetric group generated by elements fixing k points [PDF]

open access: yes, 2014
Let S n be the symmetric group on [ n ] = { 1 , … , n } . The k-point fixing graph F ( n , k ) is defined to be the graph with vertex set S n and two vertices g, h of F ( n , k ) are joined if and only if g h − 1 fixes exactly k points. In this paper, we
Kok Bin Wong, T. Lau, C. Y. Ku
semanticscholar   +1 more source

COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q [PDF]

open access: yesJournal of Algebraic Systems, 2020
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of ...
M. Ghorbani   +2 more
doaj   +1 more source

A classification of nilpotent $3$-BCI groups [PDF]

open access: yesInternational Journal of Group Theory, 2019
‎‎Given a finite group $G$ and a subset $Ssubseteq G,$ the bi-Cayley graph $bcay(G,S)$ is the graph whose vertex‎ ‎set is $G times {0,1}$ and edge set is‎ ‎${ {(x,0),(s x,1)}‎ : ‎x in G‎, ‎sin S }$‎.
Hiroki Koike, Istvan Kovacs
doaj   +1 more source

Roughness in Fuzzy Cayley Graphs

open access: yesҚарағанды университетінің хабаршысы. Математика сериясы, 2023
Rough set theory is a worth noticing approach for inexact and uncertain system modelling. When rough set theory accompanies with fuzzy set theory, which both are a complementary generalization of set theory, they will be attended by potency in ...
M.H. Shahzamanian, B. Davvaz
doaj   +1 more source

On quantum Cayley graphs [PDF]

open access: yesDocumenta Mathematica, 2023
We clarify the correspondence between two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side and suggest an ...
M. Wasilewski
semanticscholar   +1 more source

On the Cayley Graph of a Commutative Ring with Respect to its Zero-divisors [PDF]

open access: yes, 2013
Let R be a commutative ring with unity and R+ and Z*(R) be the additive group and the set of all nonzero zero-divisors of R, respectively. We denote by ℂ𝔸𝕐(R) the Cayley graph Cay(R+, Z*(R)). In this article, we study ℂ𝔸𝕐(R).
G. Aalipour, S. Akbari
semanticscholar   +1 more source

On Some Properties of Signed Cayley Graph Sn

open access: yesMathematics, 2022
We define the signed Cayley graph on Cayley graph Xn denoted by Sn, and study several properties such as balancing, clusterability and sign-compatibility of the signed Cayley graph Sn.
Deepa Sinha   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy