Results 11 to 20 of about 22,256 (275)

Conditional Strong Matching Preclusion of the Alternating Group Graph [PDF]

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   +3 more sources

A 2-arc Transitive Hexavalent Nonnormal Cayley Graph on A₁₁₉ [PDF]

Mathematics, 2021
A Cayley graph Γ=Cay(G,S) is said to be normal if the base group G is normal in AutΓ. The concept of the normality of Cayley graphs was first proposed by M.Y.
Bo Ling, Wanting Li, Bengong Lou
doaj   +2 more sources

The prime graph conjecture for integral group rings of some alternatings groups [PDF]

International Journal of Group Theory, 2013
We investigate the classical Zassenhaus Conjecture (ZC) for integral group rings of alternating groups A9 and A10. Even the question (ZC) remains open as no counterexample is known up to date, it been confirmed for special types of groups such as ...
Mohamed Salim
doaj   +2 more sources

Graph puzzles, homotopy, and the alternating group [PDF]

Journal of Combinatorial Theory, Series B, 1974
AbstractThe so-called 15-puzzle may be generalized to a puzzle based on an arbitrary graph. We consider labelings or colorings of the vertices and the operation of switching one distinguished label with a label on an adjacent vertex. Starting from a given labeling, iterations of this operation allow one to obtain all, or exactly half, of the labelings ...
Wilson, Richard M
openaire   +2 more sources

Characterization of the alternating group by its non-commuting graph [PDF]

Journal of Algebra, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollahi, Alireza, Shahverdi, Hamid
openaire   +3 more sources

Finite groups whose coprime graph is split, threshold, chordal, or a cograph [PDF]

Proceedings of the Estonian Academy of Sciences
Given 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   +3 more sources

Multi-Attribute Graph Estimation With Sparse-Group Non-Convex Penalties [PDF]

IEEE Access
We consider the problem of inferring the conditional independence graph (CIG) of high-dimensional Gaussian vectors from multi-attribute data. Most existing methods for graph estimation are based on single-attribute models where one associates a scalar ...
Jitendra K. Tugnait
doaj   +2 more sources

Index graphs of finite permutation groups

Indonesian Journal of Combinatorics, 2022
Let G be a subgroup of Sn. For x ∈ G, the index of x in G is denoted by ind x is the minimal number of 2-cycles needed to express x as a product. In this paper, we define a new kind of graph on G, namely the index graph and denoted by Γind(G). Its vertex
Haval Mohammed Salih
doaj   +1 more source

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 invariably generating graph of the alternating and symmetric groups [PDF]

, 2020
Given a finite group G, the invariably generating graph of G is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of G, and two classes are adjacent if and only if they invariably generate G.
Garzoni, Daniele
core   +1 more source