2000
DOI: 10.1002/(sici)1097-0037(200003)35:2<139::aid-net4>3.0.co;2-e
|View full text |Cite
|
Sign up to set email alerts
|

Orienting split-stars and alternating group graphs

Abstract: Akers et al. proposed an interconnection topology, the star graph, as an alternative to the popular n‐cube. Cheng et al. proposed the split‐star as an alternative to the star graph and a companion graph to the alternating group graph proposed by Jwo et al. Star graphs, alternating group graphs, and split‐stars are advantageous over n‐cubes in many aspects. Day and Tripathi proposed an assignment of directions to the edges of the star graph and showed that the resulting directed graph is strongly connected and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2003
2003
2018
2018

Publication Types

Select...
7
1
1

Relationship

2
7

Authors

Journals

citations
Cited by 27 publications
(9 citation statements)
references
References 9 publications
0
9
0
Order By: Relevance
“…An n-dimensional alternating group graph, denoted by AG n , proposed by Jwo et al [98] and further investigated by Cheng et al [31][32][33], is an undirected graph with vertices labelled with even permutations on a set of the symbols 1, 2, . .…”
Section: Alternating Group Graphsmentioning
confidence: 99%
“…An n-dimensional alternating group graph, denoted by AG n , proposed by Jwo et al [98] and further investigated by Cheng et al [31][32][33], is an undirected graph with vertices labelled with even permutations on a set of the symbols 1, 2, . .…”
Section: Alternating Group Graphsmentioning
confidence: 99%
“…Alternating group graphs were first proposed by Jwo et al [8] and further investigated by Cheng and Lipman [9][10][11]. This family of graphs has been shown to have many nice properties including vertex-transitivity, edgetransitivity, strongly hierarchy, maximally connectivity (i.e., the connectivity equals to the regularity in a graph), and has small diameter and average distance.…”
Section: Introductionmentioning
confidence: 99%
“…The directed split-stars are not only strongly connected, but, in fact, they have maximal arc-fault tolerance for connectivity and a small diameter [3][4][5]. Recently, Wang et al developed efficient distributed algorithms to obtain the unique minimum distance-k dominating sets, for k = 1, 2, and minimal feedback vertex sets on n-dimensional directed split-stars [13,14].…”
Section: Introductionmentioning
confidence: 99%