Results 11 to 20 of about 21,220 (243)
16-vertex graphs with automorphism groups A4 and A5 from the icosahedron
Electronic Journal of Graph Theory and Applications, 2020 The article deals with the problem of finding vertex-minimal graphs with a given automorphism group. We exhibit two undirected 16-vertex graphs having automorphism groups A4 and A5.
Peteris Daugulis
doaj +1 more source
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
Conditional Strong Matching Preclusion of the Alternating Group Graph
Theory and Applications of Graphs, 2019 The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
doaj +1 more source
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
Finite groups whose coprime graph is split, threshold, chordal, or a cograph [PDF]
Proceedings of the Estonian Academy of SciencesGiven a finite group G, the coprime graph of G, denoted by Î(G), is defined as an undirected graph with the vertex set G, and for distinct x, y â G, x is adjacent to y if and only if (o(x), o(y)) = 1, where o(x) and o(y) are the orders of x and y ...
Jin Chen, Shixun Lin, Xuanlong Ma
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
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
GRAPH SMALL CANCELLATION THEORY APPLIED TO ALTERNATING LINK GROUPS [PDF]
Journal of Knot Theory and Its Ramifications, 2012 We show that the Wirtinger presentation of a prime alternating link group satisfies a generalized small cancellation condition. This new version of Weinbaum's solution to the word and conjugacy problems for these groups easily extends to finite sums of alternating links.
Cunéo, Rémi, Short, Hamish
openaire +2 more sources