Results 61 to 70 of about 20,494 (188)
Novel Concepts in Rough Cayley Fuzzy Graphs with Applications
Today, fuzzy graphs (FGs) have a variety of applications in other fields of study, including medicine, engineering, and psychology, and for this reason, many researchers around the world are trying to identify their properties and use them in computer ...
Yongsheng Rao +5 more
doaj +1 more source
An extended definition of Anosov representation for relatively hyperbolic groups
Abstract We define a new family of discrete representations of relatively hyperbolic groups which unifies many existing definitions and examples of geometrically finite behavior in higher rank. The definition includes the relative Anosov representations defined by Kapovich–Leeb and Zhu, and Zhu–Zimmer, as well as holonomy representations of various ...
Theodore Weisman
wiley +1 more source
ABSTRACT Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST—a structure motivated by parallel data architectures—corresponding to composite permutations formed via Kronecker or ...
John Peca‐Medlin, Chenyang Zhong
wiley +1 more source
Normal edge-transitive and $ frac{1}{2}$-arc-transitive Cayley graphs on non-abelian groups of order $2pq$ , $p > q$ are primes [PDF]
Darafsheh and Assari in [Normal edge-transitive Cayley graphs onnon-abelian groups of order 4p, where p is a prime number,Sci. China Math. {bf 56} (1) (2013) 213$-$219.] classified the connected normal edge transitive and$frac{1}{2}-$arc-transitive ...
Ali Reza Ashrafi, Bijan Soleimani
doaj
Unitary Cayley graphs of Dedekind domain quotients
If X is a commutative ring with unity, then the unitary Cayley graph of X, denoted GX, is defined to be the graph whose vertex set is X and whose edge set is {{a,b}:a−b∈X×}.
Colin Defant
doaj +1 more source
Exactness and the topology of the space of invariant random equivalence relations
Abstract We characterize exactness of a countable group Γ$\Gamma$ in terms of invariant random equivalence relations (IREs) on Γ$\Gamma$. Specifically, we show that Γ$\Gamma$ is exact if and only if every weak limit of finite IREs is an amenable IRE.
Héctor Jardón‐Sánchez +3 more
wiley +1 more source
Domination Parameters of the Unitary Cayley Graph of /n
The unitary Cayley graph of /n, denoted Xn, is the graph with vertex set {0, . . ., n − 1} where vertices a and b are adjacent if and only if gcd(a − b, n) = 1.
Burcroff Amanda
doaj +1 more source
ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré +4 more
wiley +1 more source
Pentavalent arc-transitive Cayley graphs on Frobenius groups with soluble vertex stabilizer
A Cayley graph Γ is said to be arc-transitive if its full automorphism group AutΓ is transitive on the arc set of Γ. In this paper we give a characterization of pentavalent arc-transitive Cayley graphs on a class of Frobenius groups with soluble vertex ...
Liu Hailin
doaj +1 more source
Certifying Anosov representations
Abstract By providing new finite criteria which certify that a finitely generated subgroup of SL(d,R)$\operatorname{SL}(d,\operatorname{\mathbb {R}})$ or SL(d,C)$\operatorname{SL}(d,\mathbb {C})$ is projective Anosov, we obtain a practical algorithm to verify the Anosov condition.
J. Maxwell Riestenberg
wiley +1 more source

