Graph theory and interconnection networks.
From MaRDI portal
Recommendations
Cited in
(58)- Packing spanning trees in highly essentially connected graphs
- The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs
- Crossbar-based interconnection networks. Blocking, scalability, and reliability
- Strong matching preclusion number of graphs
- A complete classification of which (n,k)-star graphs are Cayley graphs
- Matching preclusion number of graphs
- Average distance is submultiplicative and subadditive with respect to the strong product of graphs
- Node-disjoint paths in a level block of generalized hierarchical completely connected networks
- Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\)
- A new structure for a vertex to be locally t-diagnosable in large multiprocessor systems
- Complete family reduction and spanning connectivity in line graphs
- 2-spanning cyclability problems of some generalized Petersen graphs
- Using semidirect products of groups to build classes of interconnection networks
- Variational networks of cube-connected cycles are recursive cubes of rings
- On spanning disjoint paths in line graphs
- Some nano topological structures via ideals and graphs
- Polynomially determining spanning connectivity of locally connected line 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
- Reliabilities for two kinds of graphs with smaller diameters
- Vector graph models for interconnection networks
- Conditional matching preclusion for the alternating group graphs and Split-stars
- Matching preclusion and conditional matching preclusion for crossed cubes
- Some network topological notions of the Mycielskian of a graph
- Power domination parameters in honeycomb-like networks
- The connectivity and diagnosability of interconnection networks
- GRAPHS, NETWORKS AND ACE
- scientific article; zbMATH DE number 4006276 (Why is no real title available?)
- Strong matching preclusion for augmented cubes
- scientific article; zbMATH DE number 15656 (Why is no real title available?)
- scientific article; zbMATH DE number 1151834 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- Connectivity
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
- The diagnosability of \((K_4-\{e\})\)-free graphs under the PMC diagnosis model
- Some diameter notions in lexicographic product
- A brief account on the development and future research directions of connectivity properties of interconnection networks
- Some diameter notions of Fibonacci cubes
- Fault-Hamiltonicity of Cartesian products of directed cycles
- Embedding a subclass of trees into hypercubes
- The diameter variability of the Cartesian product of graphs
- On the probability of facing random breakdowns: a measure of networks' vulnerability
- Communication Performance Evaluation of the Locally Twisted Cube
- Graph Theory and Mobile Communications
- The generalized 4-connectivity of locally twisted cubes
- Reliability evaluation of complete graph-based recursive networks
- Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube
- A tree structure for local diagnosis in multiprocessor systems under the comparison model
- Graph constructions derived from interconnection networks
- Dimensional edge fault-tolerant Hamiltonicity of (folded) hypercubes
- A new locally t-diagnosable structure under the PMC model with an application to matching composition networks
- An efficient PMC model-based local diagnosis structure and algorithm
- Spanning connectivity in graphs and line graphs with Chvátal-Erdős conditions
- Network fault costs based on minimum leaf spanning trees
- Strong matching preclusion of (n,k)-star graphs
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
This page was built for publication: Graph theory and interconnection networks.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544998)
