Results 201 to 210 of about 21,220 (243)
Some of the next articles are maybe not open access.
Conditional Diagnosability of Alternating Group Graphs
IEEE Transactions on Computers, 2013Let An be the alternating group of degree n with n ≥ 3. Set S = {(1 2 i), (1 i 2)| 3 ≤ i ≤ n}. The alternating group graph, denoted by AGn, is defined as the Cayley graph on An with respect to S. Jwo et al. [Networks 23 (1993) 315-326] introduced alternating group graph AGn as an interconnection network topology for computing systems.
null Rong-Xia Hao +2 more
openaire +1 more source
Communication algorithms on alternating group graphs
Proceedings of IEEE International Symposium on Parallel Algorithms Architecture Synthesis, 2002We study the problem of performing all-to-all broadcast on an n-alternating group graph AG/sub n/ with all-port and store-and-forward routing. The running time is [(n/sup 1/-2)/(4(n-2))+1] that is one step more than the trivial lower bound [(n/sup 2/-2)/(4(n-2))].
null Chih-Ming Lai, null Jyh-Jong Tsay
openaire +1 more source
Edge‐fault‐tolerant pancyclicity of alternating group graphs
Networks, 2009AbstractThe alternating group graph, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. Previously, the alternating group graph was shown to be pancyclic, i.e., containing cycles of all possible lengths.
Tsai, Ping-Ying +2 more
openaire +2 more sources
Prime-valent symmetric graphs admitting alternating transitive group
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Jing Jian +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.
Li, Xiaowang +3 more
openaire +1 more source
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
MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
International Journal of Foundations of Computer Science, 2008The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number for the alternating group graphs, Cayley graphs generated by 2-trees and the (n,k)-arrangement graphs.
Cheng, Eddie +3 more
openaire +1 more source