Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
type: Item
instance of: scholarly article
title: Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
zbMATH Open document ID: 1405.05092
author: Lei Zhang
author: Shiying Wang
published in: Discrete Applied Mathematics
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 7027146
zbMATH Keywords: interconnection network
zbMATH Keywords: \(k\)-restricted edge connectivity
zbMATH Keywords: \(\lambda_k\)-optimality
zbMATH Keywords: girth
MaRDI profile type: Publication
full work available at URL: j.dam.2018.07.027
OpenAlex ID: W2889968425
cites work: On the restricted connectivity and superconnectivity in graphs with given girth
cites work: Edge fault tolerance analysis of super \(k\)-restricted connected networks
cites work: Sufficient conditions for λ′‐optimality in graphs with girth g
cites work: On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\)
cites work: On unreliability polynomials and graph connectivity in reliable network synthesis
cites work: Q5422499
cites work: On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
cites work: On the construction of most reliable networks
cites work: On computing a conditional edge-connectivity of a graph
cites work: Extraconnectivity of graphs with large girth
cites work: On a kind of reliability analysis of networks
cites work: \(k\)-restricted edge-connectivity in triangle-free graphs
cites work: Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
cites work: Optimally super-edge-connected transitive graphs
cites work: Super restricted edge-connectivity of graphs with diameter 2
cites work: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
cites work: Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
cites work: A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity
cites work: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
DOI: 10.1016/J.DAM.2018.07.027
description: scientific article; zbMATH DE number 7027146