Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars

被引：25

作者：

Cheng, Eddie ^{[1
]}

Hu, Philip ^{[2
]}

Jia, Roger ^{[3
]}

Liptak, Laszlo ^{[1
]}

机构：

[1] Oakland Univ, Dept Math & Stat, Rochester, MI 48309 USA

[2] Yale Univ, New Haven, CT 06511 USA

[3] Univ Michigan, Ann Arbor, MI 48109 USA

来源：

NETWORKS | 2012年 / 59卷 / 04期

关键词：

interconnection networks; perfect matching; Cayley graphs; hyper-stars; MAXIMAL CONNECTED COMPONENT; FAULTY VERTICES;

D O I：

10.1002/net.20441

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. It is natural to look for obstruction sets beyond those induced by a single vertex. The conditional matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph with no isolated vertices that has no perfect matchings. In this companion paper of Cheng et al. (Networks (NET 1554)), we find these numbers for a number of popular interconnection networks including hypercubes, star graphs, Cayley graphs generated by transposition trees and hyper-stars. (c) 2011 Wiley Periodicals, Inc. NETWORKS, 2011

引用

页码：357 / 364

页数：8

共 30 条

[21] Conditional connectivity of Cayley graphs generated by transposition trees
Yang, Weihua
Li, Hengzhe
Meng, Jixiang
INFORMATION PROCESSING LETTERS, 2010, 110 (23) : 1027 - 1030
[22] Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs
Gupta, Sambhav
Cheng, Eddie
Liptak, Laszlo
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2022, 7 (04) : 207 - 222
[23] Conditional fractional matching preclusion of n-dimensional torus networks
Hu, Xiaomin
Tian, Yingzhi
Meng, Jixiang
Yang, Weihua
DISCRETE APPLIED MATHEMATICS, 2021, 293 : 157 - 165
[24] Conditional k-matching preclusion for n-dimensional torus networks
Hu, Xiaomin
Ren, Xiangyu
Yang, Weihua
DISCRETE APPLIED MATHEMATICS, 2024, 353 : 181 - 190
[25] Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
Lin, Ruizhi
Zhang, Heping
DISCRETE APPLIED MATHEMATICS, 2017, 233 : 104 - 117
[26] Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract)
Gupta, Sambhav
Cheng, Eddie
Liptak, Laszlo
COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 425 - 435
[27] Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC Model
Chang, Naiwen
Cheng, Eddie
Hsieh, Sunyuan
ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2015, 20 (02)
[28] CONDITIONAL DIAGNOSABILITY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITION TREES UNDER THE COMPARISON DIAGNOSIS MODEL
Lin, Cheng-Kuan
Tan, Jimmy J. M.
Hsu, Lih-Hsing
Cheng, Eddie
Liptak, Laszlo
JOURNAL OF INTERCONNECTION NETWORKS, 2008, 9 (1-2) : 83 - 97
[29] On the conditional diagnosability of Cayley graphs generated by 2-trees and related networks
Cheng, Eddie
Liptak, Laszlo
Qiu, Ke
Shen, Zhizhang
PROCEEDINGS OF THE 2012 12TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (I-SPAN 2012), 2012, : 58 - 64
[30] Fault-Tolerant Strongly Hamiltonian Laceability and Hyper-Hamiltonian Laceability of Cayley Graphs Generated by Transposition Trees
Xue, Shudan
Deng, Qingying
Li, Pingshan
COMPUTER JOURNAL, 2023, 66 (02): : 384 - 398

← 1 2 3 →