The k-restricted edge connectivity of undirected Kautz graphs

DOI10.1016/J.DISC.2009.02.004zbMATH Open1202.05082OpenAlexW2018584549MaRDI QIDQ1044003FDOQ1044003

Authors: Shiying Wang, Shangwei Lin 

Publication date: 10 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.004

Recommendations

• The restricted edge-connectivity of Kautz undirected graphs.
• The maximal restricted edge connectivity of Kautz undirected graphs
• The upper bound on \(k\)-restricted edge connectivity of a class of Kautz graphs
• scientific article; zbMATH DE number 2121669
• The \(p\)-restricted edge-connectivity of Kneser graphs
• The superrestricted edge connectivity of Kautz undirected graphs
• On 3-restricted edge connectivity of undirected binary Kautz graphs
• \(k\)-restricted edge-connectivity in triangle-free graphs
• \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
• Super restricted edge connectivity of Kautz graphs

zbMATH Keywords

restricted edge connectivityundirected Kautz graph

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Graph theory
• Line Digraph Iterations and the (d, k) Digraph Problem
• On computing a conditional edge-connectivity of a graph
• Optimally super-edge-connected transitive graphs
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• On a kind of restricted edge connectivity of graphs
• Edge-cuts leaving components of order at least three
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• Sufficient conditions for λ′‐optimality in graphs with girth g
• On 3-restricted edge connectivity of undirected binary Kautz graphs
• Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
• Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Super restricted edge connectivity of Kautz graphs
• The maximal restricted edge connectivity of Kautz undirected graphs

Cited In (19)

• The maximal restricted edge connectivity of Kautz undirected graphs
• \(k\)-restricted edge-connectivity in triangle-free graphs
• Good neighbor connectivity of directed Kautz digraphs
• Title not available (Why is that?)
• The partial diagnosability of interconnection networks under the hybrid PMC model
• Reliability analysis of undirected binary Kautz networks
• Arc fault tolerance of Kautz digraphs
• On restricted edge-connectivity of lexicographic product graphs
• Title not available (Why is that?)
• The restricted edge-connectivity of Kautz undirected graphs.
• The upper bound on \(k\)-restricted edge connectivity of a class of Kautz graphs
• Title not available (Why is that?)
• Conditional connectivity of recursive interconnection networks respect to embedding restriction
• Super restricted edge connectivity of Kautz graphs
• Conditional connectivity of star graph networks under embedding restriction
• The superrestricted edge connectivity of Kautz undirected graphs
• K-restricted edge connectivity for some interconnection networks
• On 3-restricted edge connectivity of undirected binary Kautz graphs
• Title not available (Why is that?)

This page was built for publication: The \(k\)-restricted edge connectivity of undirected Kautz graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044003)