Results 241 to 250 of about 15,265,231 (306)
Some of the next articles are maybe not open access.

On the structure of finite groups isospectral to an alternating group

Proceedings of the Steklov Institute of Mathematics, 2011
Let~\(G\) be a finite group. The set \(\omega(G)=\{|g|\mid g\in G\}\) is called its spectrum. A finite group~\(H\) is called isospectral to the group~\(G\) if \(\omega(H)=\omega(G)\). Researchers are mostly interested in groups isospectral to finite simple groups. The group \(G\) is called recognizable (by spectrum) if any group isospectral to~\(G\) is
I. Vakula
semanticscholar   +2 more sources

The High Faulty Tolerant Capability of the Alternating Group Graphs

IEEE Transactions on Parallel and Distributed Systems, 2023
The matroidal connectivity and conditional matroidal connectivity are novel indicators to measure the real faulty tolerability. In this paper, for the $n$n-dimensional alternating group graph $AG_{n}$AGn, the structure properties and (conditional ...
Hui Zhang   +4 more
semanticscholar   +1 more source

Non-Inclusive Diagnosability of Alternating Group Graphs

Parallel Processing Letters, 2023
The diagnosability is very important in multiple-processor systems. Ding et al. proposed the non-inclusive diagnosability of systems in 2020. Compared to previous diagnosability, non-inclusive diagnosability requires all faulty sets to be non-inclusive ...
Nengjin Zhuo   +3 more
semanticscholar   +1 more source

Component Connectivity of Alternating Group Networks and Godan Graphs

International Journal of Foundations of Computer Science, 2022
Connectivity is an important index to evaluate the reliability and fault tolerance of a graph. As a natural extension of the connectivity of graphs, the [Formula: see text]-component connectivity of a graph [Formula: see text], denoted by [Formula: see ...
Hong Zhang, Shuming Zhou, Qifan Zhang
semanticscholar   +1 more source

Structure and substructure connectivity of alternating group graphs

Applied Mathematics and Computation, 2021
The connectivity is an important indicator to evaluate the robustness of a network. Many works have focused on connectivity-based reliability analysis for decades.
Xiaowang Li   +3 more
semanticscholar   +1 more source

Neighbor Connectivity of the Alternating Group Graph

J. Interconnect. Networks, 2021
Given a graph [Formula: see text], its neighbor connectivity is the least number of vertices whose deletion along with their neighbors results in a disconnected, complete, or empty graph.
Mohamad Abdallah, Chun-Nan Hung
semanticscholar   +1 more source

Conditional Diagnosability of Alternating Group Networks Under the PMC Model

IEEE/ACM Transactions on Networking, 2020
Fault diagnosis of processors has played an essential role when evaluating the reliability of multiprocessor systems. In many novel multiprocessor systems, their diagnosability has been extensively explored. Conditional diagnosability is a useful measure
Nai-Wen Chang, S. Hsieh
semanticscholar   +1 more source

GCI-groups in the alternating groups

Applied Mathematics and Computation, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu Yang   +3 more
openaire   +1 more source

A well-equalized 3-CIST partition of alternating group graphs

Information Processing Letters, 2019
A set of k ( ⩾ 2 ) spanning trees in a graph is called completely independent spanning trees (CISTs for short) if they are pairwise edge-disjoint and internally vertex-disjoint.
Kung-Jui Pai, R. Chang, Jou-Ming Chang
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy