The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree
type: Item
instance of: scholarly article
title: The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree
zbMATH Open document ID: 0873.05062
DOI: 10.1016/S0012-365X(96)00367-6
published in: Discrete Mathematics
publication date: 1997-06-16T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1021678
zbMATH Keywords: nice graphs
zbMATH Keywords: vertex connectivity
zbMATH Keywords: degree
author: Andries E. Brouwer
author: Henry Martyn Mulder
MaRDI profile type: Publication
cites work: Q3992965
cites work: \((0,\lambda)\)-graphs and \(n\)-cubes
cites work: Q3890733
full work available at URL: s0012-365x(96)00367-6
OpenAlex ID: W2000974589
Recommended article: Q3356329
Recommended article: Note on the vertex 2–connectivity of a graph
Recommended article: On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Recommended article: Q4878669
Recommended article: Vertices of degree \(k\) in a minimally \(k\)-edge-connected digraph
Recommended article: On graphs with equal algebraic and vertex connectivity
Recommended article: On degrees of vertices in critically \(k\)-connected graphs
Recommended article: Some results on the degree of a vertex of a graph with respect to any vertexset
Recommended article: The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
Recommended article: The vertex-connectivity of a distance-regular graph
description: scientific article; zbMATH DE number 1021678