Matching preclusion for some interconnection networks
From MaRDI portal
Publication:5310271
DOI10.1002/net.20187zbMath1123.05073WikidataQ56638364 ScholiaQ56638364MaRDI QIDQ5310271
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
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs, Fractional Matching Preclusion for Data Center Networks, Fractional Strong Matching Preclusion for DHcube, Fractional Matching Preclusion for Data Center Networks, Fractional Matching Preclusion for (n,k)-Star Graphs, How to Secure Matchings against Edge Failures, Fractional matching preclusion for radix triangular mesh, How to Secure Matchings Against Edge Failures, Strong matching preclusion for two-dimensional torus networks, CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS, On anti-Kekulé and \(s\)-restricted matching preclusion problems, Conditional matching preclusion number of graphs, Strong matching preclusion for \(n\)-dimensional torus networks, Matching preclusion for vertex-transitive networks, Strong matching preclusion for augmented cubes, Strong matching preclusion for torus networks, Matching preclusion and conditional matching preclusion for regular interconnection networks, Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products, Matching preclusion for \(k\)-ary \(n\)-cubes, Conditional matching preclusion for the arrangement graphs, Strong matching preclusion, Note on matching preclusion number of random graphs, Strong matching preclusion of \((n,k)\)-star graphs, Conditional matching preclusion sets, Conditional matching preclusion for hypercube-like interconnection networks, Strong matching preclusion number of graphs, Strong matching preclusion for \(k\)-composition networks, Matching preclusion number of graphs, Matching preclusion number in product graphs, Matching preclusion for \(n\)-grid graphs, Matching preclusion for balanced hypercubes, Strong matching preclusion under the conditional fault model, Fractional matching preclusion number of graphs, Fractional matching preclusion of product networks, A note on generalized matching preclusion in bipartite graphs, Fractional matching preclusion for arrangement graphs, Matching preclusion and conditional matching preclusion problems for the folded Petersen cube, Matching preclusion for cube-connected cycles, Subnetwork preclusion for bubble-sort networks, Matching preclusion for \(n\)-dimensional torus networks, Strong matching preclusion for non-bipartite torus networks, The (conditional) matching preclusion for burnt pancake graphs, Strong matching preclusion for \(k\)-ary \(n\)-cubes, Conditional fractional matching preclusion of \(n\)-dimensional torus networks, Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract), Conditional fault tolerance in a class of Cayley graphs, Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions, Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars, Conditional matching preclusion for the alternating group graphs and split-stars, Matching preclusion for the (n, k)-bubble-sort graphs, MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES, MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
Uses Software
