Results 201 to 210 of about 113,466 (234)
Some of the next articles are maybe not open access.
Orienting split-stars and alternating group graphs
Networks, 2000Summary: \textit{S. B. Akers, D.Harel} and \textit{B. Kirshnamurthy}, The star graph: An attractive alterantive to the \(n\)-cube, Proc. Int. Conf. Parallel Processing, 393-400 (1987)] proposed an interconnection topology, the star graph, es an alternative to the popular \(n\)-cube. \textit{E. Cheng, M. J. Lipman} and \textit{H. A. Park} [An attractive
Cheng, Eddie, Lipman, Marc J.
openaire +2 more sources
Uni-directional alternating group graphs
1995A 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. The analysis of shortest distance between any pair of nodes in a graph of this class is also given.
Shyh-Chain Chern +2 more
openaire +1 more source
A New Characterization of Alternating Groups with Nonconnected Prime Graphs
Siberian Mathematical Journal, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Zh. B., Chen, G. Y.
openaire +1 more source
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
openaire +1 more source
The h-Component Diagnosability of Alternating Group Graphs
International Journal of Foundations of Computer ScienceWith the rapid expansion of multiprocessor systems, the fault diagnosis is becoming more and more important. The [Formula: see text]-component diagnosability of a multiprocessor system, is proposed to extend the traditional diagnosability and has been investigated widely. In this paper, we prove that under both the PMC model and MM* model the [Formula:
Nengjin Zhuo +3 more
openaire +2 more sources
Mutually independent Hamiltonian cycles in alternating group graphs
The Journal of Supercomputing, 2011The alternating group graph has been used as the underlying topology for many practical multicomputers, and has been extensively studied in the past. In this article, we will show that any alternating group graph AGn, where n≥3 is an integer, contains 2n−4 mutually independent Hamiltonian cycles.
Hsun Su, Shih-Yan Chen, Shin-Shin Kao
openaire +1 more source
Some alternating and symmetric groups and related graphs
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alireza Khalili Asboei +1 more
openaire +1 more source
Energy of Cayley graphs for alternating groups
2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Fadzil, A. F. +2 more
openaire +1 more source
Structure Connectivity and Substructure Connectivity of Alternating Group Graphs
2018 IEEE International Conference on Progress in Informatics and Computing (PIC), 2018The alternating group graph, denoted by AG n , is one of the popular interconnection networks. In this paper, we consider two network connectivities, H-structure-connectivity and H-substructure-connectivity, which are new measures for a network’s reliability and fault-tolerability.
Lantao You +5 more
openaire +1 more source
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\).
openaire +2 more sources