Center vertex — различия между версиями

Материал из WikiGrapp
Перейти к:навигация, поиск
(Новая страница: «'''Center vertex''' --- центральная вершина. A vertex <math>v</math> in a connected graph <math>G</math> is called a '''center (central) vertex''…»)
 
 
Строка 1: Строка 1:
'''Center vertex''' --- центральная вершина.  
+
'''Center vertex''' — [[центральная вершина]].  
  
A vertex <math>v</math> in a connected graph <math>G</math> is called a '''center (central) vertex''' if <math>e(v) = rad(G)</math>. A subgraph induced by central
+
A [[vertex]] <math>v</math> in a [[connected graph]] <math>G</math> is called a '''center (central) vertex''' if <math>e(v) = rad(G)</math>. A [[subgraph]] induced by central
 
vertices of <math>G</math> is called the '''center''' <math>C(G)</math> of <math>G</math>. It was
 
vertices of <math>G</math> is called the '''center''' <math>C(G)</math> of <math>G</math>. It was
proved that the center of every graph <math>H</math> is contained in a block (a
+
proved that the center of every [[graph, undirected graph, nonoriented graph|graph]] <math>H</math> is contained in a block (a
 
maximal 2-connected subgraph) of <math>H</math>.
 
maximal 2-connected subgraph) of <math>H</math>.
 +
 +
==Литература==
 +
 +
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.

Текущая версия на 12:01, 1 ноября 2012

Center vertexцентральная вершина.

A vertex v in a connected graph G is called a center (central) vertex if e(v) = rad(G). A subgraph induced by central vertices of G is called the center C(G) of G. It was proved that the center of every graph H is contained in a block (a maximal 2-connected subgraph) of H.

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.