Matching preclusion for some interconnection networks

Networks

Volumn 50, Issue 2, 2007, Pages 173-180

  Eddie, Cheng ^a   Lipták, László ^a  

^a OAKLAND UNIVERSITY   (United States)

Author keywords

(n, k) star graphs; Cayley graphs; Interconnection networks; Perfect matching

Indexed keywords

GRAPH THEORY; OPTIMAL SYSTEMS;

CAYLEY GRAPHS; PERFECT MATCHING; STAR GRAPHS;

INTERCONNECTION NETWORKS;

EID: 34548213826     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20187     Document Type: Article

References (8)

1. S.B. Akers, D. Harel, and B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, Proc Int Conf Parallel Process (1987), 393-400.
2. S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans Comput 38 (1989), 555-565.
3. T. Araki, Hyper hamiltonian laceability of Cayley graphs generated by transpositions, Networks 48 (2006), 121-124.
4. R.C. Brigham, F. Harary, E.C. Violin, and J. Yellen, Perfect-matching preclusion, Congressus Numerantium 174 (2005), 185-192.
5. W.K. Chiang and R.J. Chen, The (n, k)-star graph: A generalized star graph, Inform Proc Lett 56 (1995), 259-264.
6. H.C. Hsu, Y.L. Hsieh, J. Tan, and L.H. Hsu, Fault hamiltonicity and fault hamiltonian connectivity of the (n, k)-star graphs, Networks 42 (2004), 189-201.
7. M. Tchuente, Generation of permutations by graphical exchanges, Ars Combinatoria 14 (1982), 115-122.
8. ILOG CPLEX, webpage. http://www.ilog.com/products/cplex/.