Diameter-sufficient conditions for a graph to be super-restricted connected
type: Item
instance of: scholarly article
title: Diameter-sufficient conditions for a graph to be super-restricted connected
zbMATH Open document ID: 1169.05342
author: Mirka Miller
author: C. Balbuena
author: Yuqing Lin
published in: Discrete Applied Mathematics
publication date: 2009-03-09T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 5526334
zbMATH Keywords: diameter
zbMATH Keywords: girth
zbMATH Keywords: restricted connectivity
MaRDI profile type: Publication
full work available at URL: j.dam.2007.11.015
OpenAlex ID: W2121182408
cites work: On the order and size of \(s\)-geodetic digraphs with given connectivity
cites work: On the restricted connectivity and superconnectivity in graphs with given girth
cites work: Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
cites work: Sufficient conditions for λ′‐optimality in graphs with girth g
cites work: Synthesis of reliable networks - a survey
cites work: Circulants and their connectivities
cites work: Q4350166
cites work: On computing a conditional edge-connectivity of a graph
cites work: Maximally connected digraphs
cites work: Q3490015
cites work: Conditional connectivity
cites work: Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
cites work: Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
cites work: Q4260012
cites work: On a kind of restricted edge connectivity of graphs
cites work: Q5463565
cites work: Q5466060
cites work: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
cites work: Super-edge-connectivity properties of graphs with diameter 2
cites work: Super restricted edge-connectivity of vertex-transitive graphs
cites work: On restricted edge-connectivity of graphs.
cites work: Super connectivity of line graphs
cites work: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
cites work: On optimally-\(\lambda^{(3)}\) transitive graphs
DOI: 10.1016/J.DAM.2007.11.015
description: scientific article; zbMATH DE number 5526334