A new approach to finding the extra connectivity of graphs
DOI10.1016/J.DAM.2021.02.017zbMATH Open1459.05144OpenAlexW3134920783MaRDI QIDQ2656973FDOQ2656973
Authors: Qiang Zhu, Fang Ma, Guodong Guo, Dajin Wang 
Publication date: 17 March 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.02.017
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40) Network design and communication in computer systems (68M10)
Cites Work
- Connectivity measures in matched sum graphs
- Extraconnectivity of graphs with large girth
- Edge fault tolerance analysis of a class of interconnection networks
- Restricted connectivity for three families of interconnection networks
- Linearly many faults in Cayley graphs generated by transposition trees
- Graph theory with applications
- Conditional connectivity
- Synthesis of reliable networks - a survey
- Title not available (Why is that?)
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Generalized measures of fault tolerance in hypercube networks
- Conditional fault diagnosis of hierarchical hypercubes
- The super connectivity of the pancake graphs and the super laceability of the star graphs
- The super connectivity of exchanged hypercubes
- Restricted arc-connectivity of digraphs
- Extraconnectivity of hypercubes
- Super connectivity of line graphs
- On computing a conditional edge-connectivity of a graph
- Super restricted edge-connectivity of vertex-transitive graphs
- Reliability Evaluation of BC Networks
- Optimal numberings and isoperimetric problems on graphs
- Super connectivity of Kronecker products of graphs
- The super connectivity of augmented cubes
- On a kind of restricted edge connectivity of graphs
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Increasing the connectivity of the star graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Lower bounds for the isoperimetric numbers of random regular graphs
- On reliability of the folded hypercubes
- On the 3-restricted edge connectivity of permutation graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- On super and restricted connectivity of some interconnection networks.
- K-restricted edge connectivity for some interconnection networks
- On super edge-connectivity of Cartesian product graphs
- Title not available (Why is that?)
- Super restricted edge connected Cartesian product graphs
- Diameter-sufficient conditions for a graph to be super-restricted connected
- On conditional diagnosability of the folded hypercubes
- Super edge connectivity properties of connected edge symmetric graphs
- The restricted arc connectivity of Cartesian product digraphs
- Increasing the connectivity of split-stars
- Super edge-connectivity of dense digraphs and graphs
- Bounds on isoperimetric values of trees
Cited In (8)
- An extension of the Newman-Janis algorithm
- A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model
- Generalized fault-tolerance for enhanced hypercubes
- High fault-tolerant performance of the divide-and-swap cube network
- Note on reliability of star graphs
- Structure connectivity and substructure connectivity of split-star networks
- \(r\)-component diagnosability of hypercubes under the PMC model
- Title not available (Why is that?)
This page was built for publication: A new approach to finding the extra connectivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656973)
