SOME MINIMAX PROBLEMS FOR GRAPHS

被引：8
|
作者：
FIEDLER, M
机构：
[1] Math. Institute Academy, 115 67 Prague
来源：
DISCRETE MATHEMATICS | 1993年 / 121卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(93)90538-5
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
If a characteristic of a simple graph G allows an extension to nonnegative edge valuations of G, the corresponding absolute characteristic is defined as the extreme of the characteristic over all nonnegative edge valuations of G with an average value of 1. A survey of the results for previously studied cases is given and new results on the absolute algebraic connectivity, absolute diameter and absolute radius of a tree are added.
引用
收藏
页码：65 / 74
页数：10
相关论文
共 50 条
12345