Results 21 to 30 of about 22,256 (275)
McKay graphs for alternating and classical groups [PDF]
Transactions of the American Mathematical Society, 2021 Let G G be a finite group, and
Liebeck, M, Shalev, A, Tiep, PH
openaire +3 more sources
The clique number of the intersection graph of a cyclic group of order with at most three prime factors [PDF]
ریاضی و جامعه, 2023 Let $G$ be a finite non-trivial group. The intersection graph $\Gamma(G)$, is a graph whose vertices are all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H $ and $K$ if and only if $H\cap K\neq 1$.
Seyyed Majid Jafarian Amiri +1 more
doaj +1 more source
Stable K Multiple-Means Clustering Algorithm
Jisuanji kexue yu tansuo, 2021 For improving the performance of K-means on the nonconvex cluster, a multiple-means clustering method with specified K clusters partitions the original data into multiple subclasses, and formalizes the multiple-means clustering problem as an optimization
ZHANG Nini, GE Hongwei
doaj +1 more source
Network Neuroscience, 2021 Recent developments of whole-brain models have demonstrated their potential when investigating resting-state brain activity. However, it has not been systematically investigated how alternating derivations of the empirical structural and functional ...
Justin W. M. Domhof +3 more
doaj +1 more source
Maximal cocliques in the generating graphs of the alternating and symmetric groups
Combinatorial Theory, 2022 The generating graph $Γ(G)$ of a finite group $G$ has vertex set the non-identity elements of $G$, with two elements connected exactly when they generate $G$. A coclique in a graph is an empty induced subgraph, so a coclique in $Γ(G)$ is a subset of $G$ such that no pair of elements generate $G$.
Veronica Kelsey, Colva M. Roney-Dougal
openaire +5 more sources
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
IEEE Access, 2020 A set of spanning trees in a graph G is called independent spanning trees (ISTs) if they are rooted at the same vertex r, and for each vertex v(≠ r) in G, the two paths from v to r in any two trees share no common vertex expect for v and r.
Jie-Fu Huang +3 more
doaj +1 more source
IEEE Access, 2019 For an integer ℓ ≥ 2, the ℓ-component connectivity of a graph G, denoted by κℓ(G), is the minimum number of vertices whose removal from G results in a disconnected graph with at least ℓ components or a graph with
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
doaj +1 more source
Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness [PDF]
, 2002 Akers et al. (Proceedings of the International Conference on Parallel Processing, 1987, pp. 393–400) proposed an interconnection topology, the star graph, as an alternative to the popular n-cube. Jwo et al.
Marc J. Lipman +3 more
core +1 more source
Graph-Based Clustering via Group Sparsity and Manifold Regularization
IEEE Access, 2019 Clustering refers to the problem of partitioning data into several groups according to the predefined criterion. Graph-based method is one of main clustering approaches and has been shown impressive performance in many literatures.
Jianyu Miao +3 more
doaj +1 more source
Generating the alternating group by cyclic triples [PDF]
, 1975 It is shown that a collection of circular permutations of length three on an n-set generates the alternating group An if and only if the associated graph is connected.
Lewin, Mordechai, Mordechai Lewin
core +1 more source