Results 41 to 50 of about 21,220 (243)
GRAPHS WHOSE AUTOMORPHISM GROUPS CONTAIN THE ALTERNATING GROUPS
There have been many investigations on the combinatorial structures and invariants over the group actions on the subsets of its elements. Automorphism groups from Graphs containing the cyclic and dihedral groups, Cn and Dn respectively have been constructed using Schur’s Algorithm.
openaire +1 more source
Quasirecognition by prime graph of some alternating groups
Let G be a finite group. We denote by Γ(G) the prime graph of G. Hagie in (M. Hagie, (2003), The prime graph of a sporadic simple group, Comm. Algebra, 31: 4405-4424) determined finite groups G satisfying Γ(G )=Γ (S), where S is a sporadic simple group. In this paper we determine finite groups G such that Γ(G )=Γ (Ap), where p and p − 2 are primes.
B. Khosravi, A. Zarea Moghanjoghi
openaire +1 more source
Dicarboxylate‐modified anionic hairy cellulose nanocrystals exhibit a high selectivity for dysprosium(III) over neodymium(III). This selectivity arises from disordered dicarboxylate cellulose “hairs” that enable cooperative ionic coordination, hydrogen bonding, and strain‐induced conformational shrinkage.
Roya Koshani +6 more
wiley +1 more source
Multi-Attribute Graph Estimation With Sparse-Group Non-Convex Penalties
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 +1 more source
Graph puzzles, homotopy, and the alternating group
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 ...
openaire +1 more source
Distance transitive graphs with symmetric or alternating automorphism group [PDF]
The paper classifies all distance transitive graphs Γ such thatAn≤ Aut Γ ≤ AutAnfor some alternating groupAn, and Aut Γ acts primitively on the vertices of Γ. This result forms part of our programme for determining all finite primitive distance transitive graphs.
Liebeck, Martin W. +2 more
openaire +2 more sources
Strong exciton‐photon coupling is achieved by integrating porphyrin ligand‐based MOF nanoparticles in optical cavities, as evidenced by pronounced polariton branch anticrossing. The porous nature of the resonator enables precise, reversible tuning via vapor pressure, unlocking unprecedented chemical‐environment controlled dynamic polaritonic platforms ...
Beatriz de Sola‐Báez +7 more
wiley +1 more source
A Cu‐based crystal‐glass composite with high‐density twins is identified by a fast screening technique using combinatorial sputtering together with XRD and nanoindentation mapping. This bamboo‐like structure demonstrates homogenous plastic flow and retains high strength during in situ high temperature tests, up to 1 GPa at 550°C, owing to those ...
Chunhua Tian +10 more
wiley +1 more source
Generalized matrix functions, determinant and permanent
Introduction Since linear and multilinear algebra has many applications in different branches of sciences, the attention of many mathematicians has been attracted to it in recent decades. The determinant and the permanent are the most important functions
Mohammad Hossein Jafari, Ali Reza Madadi
doaj
Reliability Analysis of Alternating Group Graphs and Split-Stars
AbstractGiven a connected graph $G$ and a positive integer $\ell $, the $\ell $-extra (resp. $\ell $-component) edge connectivity of $G$, denoted by $\lambda ^{(\ell )}(G)$ (resp. $\lambda _{\ell }(G)$), is the minimum number of edges whose removal from $G$ results in a disconnected graph so that every component has more than $\ell $ vertices (resp. so
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
openaire +1 more source

