scientific article; zbMATH DE number 2010366
From MaRDI portal
Publication:4435203
Recommendations
Cited in
(only showing first 100 items - show all)- On super edge-connectivity of product graphs
- Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
- Forwarding index of cube-connected cycles
- The independence number for de Bruijn networks and Kautz networks
- On the bipanpositionable bipanconnectedness of hypercubes
- Edge-fault-tolerant bipanconnectivity of hypercubes
- Diameter vulnerability of graphs by edge deletion
- A line digraph of a complete bipartite digraph
- Reinforcement numbers of digraphs
- Exact wirelength of hypercubes on a grid
- Super-connected arc-transitive digraphs
- Fault-tolerant panconnectivity of augmented cubes
- Super connectivity of line graphs
- Survey on path and cycle embedding in some networks
- Edge-pancyclicity of Möbius cubes
- Edge-fault-tolerant edge-bipancyclicity of hypercubes
- The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs
- The super connectivity of folded crossed cubes
- Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
- Crossbar-based interconnection networks. Blocking, scalability, and reliability
- Computing topological indices of sudoku graphs
- On the bounds of degree-based topological indices of the Cartesian product of \(F\)-sum of connected graphs
- Towards a problem of Ruskey and Savage on matching extendability
- On restricted edge-connectivity of replacement product graphs
- The Kirchhoff index of toroidal meshes and variant networks
- The Kirchhoff index of folded hypercubes and some variant networks
- Some properties on Estrada index of folded hypercubes networks
- The Kirchhoff index of some combinatorial networks
- On conditional fault tolerance of hierarchical cubic networks
- The 4-component connectivity of alternating group networks
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs
- Fault diagnosability of DQcube under the PMC model
- On the reliability of alternating group graph-based networks
- Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
- Domination numbers of undirected toroidal mesh
- Wirelength of hypercubes into certain trees
- Super edge-connectivity of de Bruijn and Kautz undirected graphs
- Node-disjoint paths in a level block of generalized hierarchical completely connected networks
- Super-connected but not super edge-connected graphs
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- Conditional fault tolerance of arrangement graphs
- The super connectivity of exchanged hypercubes
- A note on cycle embedding in hypercubes with faulty vertices
- On topological indices for new classes of Benes network
- The generalized measure of edge fault tolerance in exchanged crossed cube
- Connectivity and super connectivity of the divide-and-swap cube
- A linear time algorithm for embedding hypercube into cylinder and torus
- On the isometric path partition problem
- Characterization of the congestion lemma on layout computation
- Reliability assessment for modified bubble-sort networks
- On the resistance diameter of hypercubes
- Note on reliability evaluation of arrangement graphs
- \(L(n)\) graphs are vertex-pancyclic and Hamilton-connected
- Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes
- Possibility degree-based interval-valued \(q\)-rung orthopair fuzzy graphs
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
- Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes
- Using semidirect products of groups to build classes of interconnection networks
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
- Symmetric property and reliability of locally twisted cubes
- Reliability measure of multiprocessor system based on enhanced hypercubes
- Parsimonious formulations for low-diameter clusters
- Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity
- A new performance measure for characterizing fault rings in interconnection networks
- Fault tolerance analysis of hierarchical folded cube
- On the \(g\)-good-neighbor connectivity of graphs
- Generalized measures of fault tolerance for bubble sort networks
- Variational networks of cube-connected cycles are recursive cubes of rings
- The Kirchhoff index of hypercubes and related complex networks
- On a relationship between Cayley graphs and \(G\)-graphs with some applications
- Optimizing Hamiltonian panconnectedness for the crossed cube architecture
- Path embeddings with prescribed edge in the balanced hypercube network
- Topological properties on the diameters of the integer simplex
- Conjectures on wirelength of hypercube into cylinder and torus
- A note on the locating-total domination in graphs
- The hyperbolicity constant of infinite circulant graphs
- Fault-tolerant pancyclicity of augmented cubes
- Fault-tolerant analysis of a class of networks
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Vertex-bipancyclicity of the generalized honeycomb tori
- The vulnerability of the diameter of the enhanced hypercubes
- The \(h\)-connectivity of exchanged crossed cube
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- Generalized measures of fault tolerance in exchanged hypercubes
- Edge-fault tolerance of hypercube-like networks
- Paired many-to-many disjoint path covers of the hypercubes
- On the partition dimension of a class of circulant graphs
- Embedding of hypercubes into sibling trees
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- On the strong distance problems of pyramid networks
- The bondage numbers and efficient dominations of vertex-transitive graphs
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
- The bondage numbers of extended de Bruijn and Kautz digraphs
- Cycles in folded hypercubes
- Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435203)
