Results 231 to 240 of about 22,256 (275)
Some of the next articles are maybe not open access.
Panpositionable hamiltonicity of the alternating group graphs
Networks, 2007AbstractThe alternating group graph AGn is an interconnection network topology based on the Cayley graph of the alternating group. There are some interesting results concerning the hamiltonicity and the fault tolerant hamiltonicity of the alternating group graphs. In this article, we propose a new concept called panpositionable hamiltonicity.
Yuan-Hsiang Teng +2 more
exaly +2 more sources
A kind of conditional fault tolerance of alternating group graphs [PDF]
Information Processing Letters, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Zhao, Xiong, Wei, Yang, Weihua
openaire +4 more sources
Energy of Cayley graphs for alternating groups [PDF]
, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Fadzil, A. F. +2 more
openaire +3 more sources
On nonabelian simple groups having the same prime graph as an alternating group
Siberian Mathematical Journal, 2013Let \(G\) be a finite group and let \(\pi(G)\) be the set of all prime divisors of its order. The prime graph \(GK(G)\) of \(G\) is defined as follows: \(\pi(G)\) is the set of vertices of \(GK(G)\) and two distinct vertices \(p,q\in\pi(G)\) are adjacent if and only if there exists an element of order \(pq\) in \(G\).
exaly +3 more sources
Neighbor Connectivity of the Alternating Group Graph
Journal of Interconnection Networks, 2021Given 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. The edge neighbor connectivity is the least number of edges whose deletion along with their endpoints results in a disconnected, complete, or empty graph.
Mohamad Abdallah, Chun-Nan Hung
openaire +1 more source
An Analysis on the Reliability of the Alternating Group Graph
IEEE Transactions on Reliability, 2021For interconnection network losing processors, usually, when the surviving network has a large connected component, it can be used as a functional subsystem without leading to severe performance degradation. Consequently, it is crucial to characterize the interprocessor communication ability and efficiency of the surviving structure.
Limei Lin +4 more
openaire +1 more source
Non-Inclusive Diagnosability of Alternating Group Graphs
Parallel Processing Letters, 2023The 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
openaire +1 more source
Structure and substructure connectivity of alternating group graphs
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaowang Li +3 more
openaire +1 more source
Component Connectivity of Alternating Group Networks and Godan Graphs
International Journal of Foundations of Computer Science, 2022Connectivity 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 text], is the minimum number of vertices whose removal from [Formula: see text] results in a ...
Hong Zhang 0044 +2 more
openaire +2 more sources
Uni-directional Alternating Group Graphs. [PDF]
J. Inf. Sci. Eng., 1999 A class of uni-directional Cayley graphs based on alternating groups is proposed in this paper. It is shown that this class of graphs is strongly connected and recursively scalable.
Jung-Sing Jwo, Tai-Ching Tuan
openaire +2 more sources