Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
Minimal κ-connected Graphs with Small Number of Vertices of Degree κ. / Karpov, Dmitri V.
в: Fundamenta Informaticae, Том 145, № 3, 01.01.2016, стр. 279-312.Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
}
TY - JOUR
T1 - Minimal κ-connected Graphs with Small Number of Vertices of Degree κ
AU - Karpov, Dmitri V.
PY - 2016/1/1
Y1 - 2016/1/1
N2 - Connectivity is one of the basic concepts of graph theory. It asks for the minimum number of elements. A graph is called k-connected or k-vertex-connected if its vertex connectivity is k or greater. The author defines a connected component of a graph as a vertex set of its maximal up to inclusion connected subgraph.
AB - Connectivity is one of the basic concepts of graph theory. It asks for the minimum number of elements. A graph is called k-connected or k-vertex-connected if its vertex connectivity is k or greater. The author defines a connected component of a graph as a vertex set of its maximal up to inclusion connected subgraph.
UR - http://www.scopus.com/inward/record.url?scp=84984906771&partnerID=8YFLogxK
U2 - 10.3233/FI-2016-1361
DO - 10.3233/FI-2016-1361
M3 - Article
AN - SCOPUS:84984906771
VL - 145
SP - 279
EP - 312
JO - Fundamenta Informaticae
JF - Fundamenta Informaticae
SN - 0169-2968
IS - 3
ER -
ID: 36925247