Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper‐stars
Copyright policy )Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper‐stars
AbstractThe 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. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011
- Yale University United States
- Oakland University United States
- University of Michigan United States
- University of Rochester United States
- University of New Haven United States
Interconnection Networks, hyper-stars, Hyper‐Stars, Extremal problems in graph theory, Network design and communication in computer systems, Economics, perfect matching, Perfect Matching, Cayley Graphs, Industrial and Operations Engineering, Cayley graphs, Management, Graphs and abstract algebra (groups, rings, fields, etc.), Engineering, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Business, Small world graphs, complex networks (graph-theoretic aspects), interconnection networks
Interconnection Networks, hyper-stars, Hyper‐Stars, Extremal problems in graph theory, Network design and communication in computer systems, Economics, perfect matching, Perfect Matching, Cayley Graphs, Industrial and Operations Engineering, Cayley graphs, Management, Graphs and abstract algebra (groups, rings, fields, etc.), Engineering, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Business, Small world graphs, complex networks (graph-theoretic aspects), interconnection networks
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).27 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!