MINIMUM CONGESTION SPANNING TREES IN BIPARTITE AND RANDOM GRAPHS

The first problem considered in this article reads： is it possible to find upper estimates for the spanning tree congestion in bipartite graphs, which are better than those for general graphs？ It is proved that there exists a bipartite version of the known graph with spanning tree congestion of orde...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Acta mathematica scientia 2011-03, Vol.31 (2), p.634-640
1. Verfasser:	Ostrovskii, M.I.
Format:	Artikel
Sprache:	eng
Schlagworte:	05C05 Bipartite graph Congestion congestion spanning tree Estimates Graph theory Graphs Mathematical models minimum random graph 二部图 最小生成树 标准模型 随机图 顶点数
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!