On the distance function of a connected graph

被引：0

作者：

Ladislav Nebeský

机构：

[1] Univerzita Karlova v Praze,

[2] Filozofická fakulta,undefined

来源：

Czechoslovak Mathematical Journal | 2008年 / 58卷

关键词：

connected graph; distance function;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

An axiomatic characterization of the distance function of a connected graph is given in this note. The triangle inequality is not contained in this characterization.

引用

页码：1101 / 1106

页数：5

共 50 条

[1] ON THE DISTANCE FUNCTION OF A CONNECTED GRAPH
Nebesky, Ladislav
CZECHOSLOVAK MATHEMATICAL JOURNAL, 2008, 58 (04) : 1101 - 1106
[2] THE AVERAGE DISTANCE OF A CONNECTED GRAPH
施容华
ChineseScienceBulletin, 1991, (04) : 348 - 348
[3] THE AVERAGE DISTANCE OF A CONNECTED GRAPH
SHI, RH
CHINESE SCIENCE BULLETIN, 1991, 36 (04): : 348 - 349
[4] On the distance α-spectral radius of a connected graph
Haiyan Guo
Bo Zhou
Journal of Inequalities and Applications, 2020
[5] On the distanceα-spectral radius of a connected graph
Guo, Haiyan
Zhou, Bo
JOURNAL OF INEQUALITIES AND APPLICATIONS, 2020, 2020 (01)
[6] The inertia and energy of the distance matrix of a connected graph
Lin, Huiqiu
Liu, Ruifang
Lu, Xiwen
LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 467 : 29 - 39
[7] Distance irredundance and connected domination numbers of a graph
Xu, Jun-Ming
Tian, Fang
Huang, Jia
DISCRETE MATHEMATICS, 2006, 306 (22) : 2943 - 2953
[8] On the largest eigenvalue of the distance matrix of a connected graph
Zhou, Bo
Trinajstic, Nenad
CHEMICAL PHYSICS LETTERS, 2007, 447 (4-6) : 384 - 387
[9] A CHARACTERIZATION OF THE INTERVAL FUNCTION OF A CONNECTED GRAPH
NEBESKY, L
CZECHOSLOVAK MATHEMATICAL JOURNAL, 1994, 44 (01) : 173 - 178
[10] Bounding the distance among longest paths in a connected graph
Ekstein, Jan
Fujita, Shinya
Kabela, Adam
Teska, Jakub
DISCRETE MATHEMATICS, 2018, 341 (04) : 1155 - 1159

← 1 2 3 4 5 →