scientific article
From MaRDI portal
Publication:3544998
zbMath1168.05002MaRDI QIDQ3544998
Publication date: 8 December 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05Cxx)
Related Items (41)
Packing spanning trees in highly essentially connected graphs ⋮ The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs ⋮ On spanning disjoint paths in line graphs ⋮ Some network topological notions of the Mycielskian of a graph ⋮ Some nano topological structures via ideals and graphs ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ 2-spanning cyclability problems of some generalized Petersen graphs ⋮ Strong matching preclusion for augmented cubes ⋮ Node-disjoint paths in a level block of generalized hierarchical completely connected networks ⋮ The generalized 4-connectivity of locally twisted cubes ⋮ Reliability evaluation of complete graph-based recursive networks ⋮ Using semidirect products of groups to build classes of interconnection networks ⋮ Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube ⋮ Strong matching preclusion number of graphs ⋮ Some diameter notions of Fibonacci cubes ⋮ A tree structure for local diagnosis in multiprocessor systems under the comparison model ⋮ Strong matching preclusion of \((n,k)\)-star graphs ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ Reliability evaluation of subsystem based on exchanged hypercube ⋮ A new measure for locally \(t\)-diagnosable under PMC model ⋮ Degree sequence conditions for a graph to be disjoint path coverable ⋮ A complete classification of which \((n,k)\)-star graphs are Cayley graphs ⋮ Reliabilities for two kinds of graphs with smaller diameters ⋮ Matching preclusion number of graphs ⋮ Conditional matching preclusion for the alternating group graphs and split-stars ⋮ Power Domination Parameters in Honeycomb-Like Networks ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ Average distance is submultiplicative and subadditive with respect to the strong product of graphs ⋮ Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs ⋮ Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\) ⋮ THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS ⋮ Embedding a subclass of trees into hypercubes ⋮ On the probability of facing random breakdowns: a measure of networks’ vulnerability ⋮ Fault-Hamiltonicity of Cartesian products of directed cycles ⋮ Variational networks of cube-connected cycles are recursive cubes of rings ⋮ The Diagnosability of (K4 – {e})-free Graphs under the PMC Diagnosis Model ⋮ A new structure for a vertex to be locally \(t\)-diagnosable in large multiprocessor systems ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Some diameter notions in lexicographic product of graphs ⋮ Communication Performance Evaluation of the Locally Twisted Cube ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
This page was built for publication:
