Аноним

Bandwidth sum: различия между версиями

Материал из WikiGrapp
нет описания правки
(Новая страница: «'''Bandwidth sum''' --- широкополосная сумма. The '''bandwidth sum''' of a graph <math>G</math>, denoted by <math>B_{s}(G)</math>, is defined by…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Bandwidth sum''' --- широкополосная сумма.  
'''Bandwidth sum''' — ''[[широкополосная сумма]].''


The '''bandwidth sum''' of a graph <math>G</math>, denoted by <math>B_{s}(G)</math>, is
The '''bandwidth sum''' of a [[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math>, denoted by <math>\,B_{s}(G)</math>, is defined by
defined by


<math>B_{s}(G) = \min \sum _{uv \in E(G)}|f(u) - f(v)|,</math>
<math>B_{s}(G) = \min \sum _{uv \in E(G)}|f(u) - f(v)|,</math>


where minimum is is taken for all ''proper labelings'' of <math>G</math>.
where minimum is is taken for all ''proper labelings'' of <math>\,G</math>.
 
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.