On super restricted edge connectivity of half vertex transitive graphs
type: Item
instance of: scholarly article
title: On super restricted edge connectivity of half vertex transitive graphs
zbMATH Open document ID: 1256.05104
author: Yingzhi Tian
author: Xiaodong Liang
author: Jixiang Meng
published in: Graphs and Combinatorics
publication date: 2012-12-27T00:00:00Z
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6118574
zbMATH Keywords: connected half vertex transitive graphs
zbMATH Keywords: bi-Cayley graphs
zbMATH Keywords: restricted edge connectivity
zbMATH Keywords: super restricted edge connectivity
zbMATH Keywords: super restricted edge connected
zbMATH Keywords: superatoms
zbMATH Keywords: minimum edge degree
zbMATH Keywords: component
zbMATH Keywords: minimum edge set
zbMATH Keywords: bipartite graph
zbMATH Keywords: automorphism group
MaRDI profile type: Publication
full work available at URL: s00373-011-1035-0
OpenAlex ID: W1996906085
cites work: Complexity of network reliability computations
cites work: Combinatorial optimization problems in the analysis and design of probabilistic networks
cites work: On computing a conditional edge-connectivity of a graph
cites work: Conditional connectivity
cites work: Q4260012
cites work: Optimally super-edge-connected transitive graphs
cites work: On a kind of restricted edge connectivity of graphs
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: Q4870157
cites work: Super restricted edge-connectivity of vertex-transitive graphs
cites work: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
cites work: On restricted edge-connectivity of graphs.
cites work: Q5492623
DOI: 10.1007/S00373-011-1035-0
description: scientific article; zbMATH DE number 6118574