A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees

DOI10.1016/j.ins.2011.05.010zbMath1244.05111OpenAlexW1998593254MaRDI QIDQ433082

Xiaofeng Guo, Eddie Cheng, Zhao Zhang, László Lipták, Weihua Yang

Publication date: 13 July 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.05.010

zbMATH Keywords

Cayley graphsconditional vertex connectivity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Related Items (16)

\(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks ⋮ The \(g\)-good-neighbor conditional diagnosability of locally twisted cubes ⋮ Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs ⋮ On \(g\)-good-neighbor conditional connectivity and diagnosability of hierarchical star networks ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Path and cycle fault tolerance of bubble-sort graph networks ⋮ On conditional fault tolerance and diagnosability of hierarchical cubic networks ⋮ The Component (Edge) Connectivity of Round Matching Composition Networks ⋮ A kind of conditional connectivity of transposition networks generated by \(k\)-trees ⋮ A kind of conditional connectivity of Cayley graphs generated by wheel graphs ⋮ The \(h\)-restricted connectivity of balanced hypercubes ⋮ Conditional connectivity of recursive interconnection networks respect to embedding restriction ⋮ Some conditional vertex connectivities of complete-transposition graphs ⋮ Super \(R^k\)-vertex-connectedness ⋮ The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes ⋮ The restricted \(h\)-connectivity of the data center network DCell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• Fault-tolerant edge-pancyclicity of locally twisted cubes
• Independent spanning trees on even networks
• Augmented \(k\)-ary \(n\)-cubes
• Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
• Fault-tolerant Hamiltonicity of twisted cubes
• Bipancyclic properties of Cayley graphs generated by transpositions
• Hamiltonian connectivity of 2-tree-generated networks
• A kind of conditional vertex connectivity of star graphs
• A survey of integrity
• A faster algorithm for computing the strength of a network
• The shuffle-cubes and their generalization
• A kind of conditional fault tolerance of alternating group graphs
• Linearly many faults in Cayley graphs generated by transposition trees
• Toughness in graphs -- a survey
• A note on embeddings among folded hypercubes, even graphs and odd graphs
• Linearly many faults in 2-tree-generated networks
• FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
• Cyclic Vertex Connectivity of Star Graphs
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• Optimal attack and reinforcement of a network
• The Mobius cubes
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
• A new class of interconnection networks based on the alternating group
• The number of labeled k-dimensional trees
• Properties and characterizations of k ‐trees

This page was built for publication: A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees