Matching preclusion for some interconnection networks

From MaRDI portal
Publication:5310271

DOI10.1002/net.20187zbMath1123.05073OpenAlexW4245743540WikidataQ56638364 ScholiaQ56638364MaRDI QIDQ5310271

Eddie Cheng, László Lipták

Publication date: 21 September 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20187




Related Items (52)

Strong matching preclusion for \(n\)-dimensional torus networksMatching preclusion for vertex-transitive networksMatching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditionsMatching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-starsStrong matching preclusion for non-bipartite torus networksConditional fractional matching preclusion of \(n\)-dimensional torus networksA Short Note of Strong Matching Preclusion for a Class of Arrangement GraphsFractional Matching Preclusion for Data Center NetworksFractional Strong Matching Preclusion for DHcubeFractional Matching Preclusion for Data Center NetworksFractional Matching Preclusion for (n,k)-Star GraphsMatching preclusion for \(k\)-ary \(n\)-cubesStrong matching preclusion for augmented cubesStrong matching preclusion for torus networksMatching preclusion for balanced hypercubesOn anti-Kekulé and \(s\)-restricted matching preclusion problemsConditional matching preclusion number of graphsStrong matching preclusion number of graphsStrong matching preclusion for \(k\)-composition networksStrong matching preclusion of \((n,k)\)-star graphsStrong matching preclusion under the conditional fault modelConditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)Matching preclusion and conditional matching preclusion for regular interconnection networksMatching preclusion and conditional matching preclusion problems for tori and related Cartesian productsFractional matching preclusion of product networksMatching preclusion number of graphsThe (conditional) matching preclusion for burnt pancake graphsStrong matching preclusion for \(k\)-ary \(n\)-cubesConditional matching preclusion for the arrangement graphsStrong matching preclusionMatching preclusion number in product graphsConditional matching preclusion for the alternating group graphs and split-starsHow to Secure Matchings against Edge FailuresCONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHSMatching preclusion for \(n\)-grid graphsA note on generalized matching preclusion in bipartite graphsMatching preclusion for the (n, k)-bubble-sort graphsFractional matching preclusion for radix triangular meshMATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONSConditional fault tolerance in a class of Cayley graphsConditional matching preclusion setsHow to Secure Matchings Against Edge FailuresConditional matching preclusion for hypercube-like interconnection networksFractional matching preclusion number of graphsNote on matching preclusion number of random graphsFractional matching preclusion for arrangement graphsStrong matching preclusion for two-dimensional torus networksMatching preclusion and conditional matching preclusion problems for the folded Petersen cubeMATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBESMatching preclusion for cube-connected cyclesSubnetwork preclusion for bubble-sort networksMatching preclusion for \(n\)-dimensional torus networks


Uses Software



This page was built for publication: Matching preclusion for some interconnection networks