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 条
  • [31] Building k-edge-connected neighborhood graph for distance-based data projection
    Li, Y
    PATTERN RECOGNITION LETTERS, 2005, 26 (13) : 2015 - 2021
  • [32] A note on Bartholdi zeta function and graph invariants based on resistance distance
    Li, Deqiong
    Hou, Yaoping
    DISCRETE MATHEMATICS, 2018, 341 (03) : 786 - 792
  • [33] On the minimum augmentation of an l-connected graph to a k-connected graph
    Ishii, T
    Nagamochi, H
    ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 286 - 299
  • [34] A Cheeger inequality of a distance regular graph using Green's function
    Kim, Gil Chun
    Lee, Yoonjin
    DISCRETE MATHEMATICS, 2013, 313 (20) : 2337 - 2347
  • [35] A comparative analysis of new graph distance measures and graph edit distance
    Li, Tao
    Dong, Han
    Shi, Yongtang
    Dehmer, Matthias
    INFORMATION SCIENCES, 2017, 403 : 15 - 21
  • [36] How to contract an essentially 6-connected graph to a 5-connected graph
    Kriesell, Matthias
    DISCRETE MATHEMATICS, 2007, 307 (3-5) : 494 - 510
  • [37] Distance in the curve graph
    Ursula Hamenstädt
    Geometriae Dedicata, 2014, 168 : 101 - 112
  • [38] MEAN DISTANCE IN A GRAPH
    DOYLE, JK
    GRAVER, JE
    DISCRETE MATHEMATICS, 1977, 17 (02) : 147 - 154
  • [39] On the degree distance of a graph
    Dankelmann, P.
    Gutman, I.
    Mukwembi, S.
    Swart, H. C.
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (13) : 2773 - 2777
  • [40] THE GRAPH DISTANCE GAME
    Goddard, Wayne
    Sinko, Anne
    Slater, Peter
    Xu, Honghai
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2011, 8 (01) : 85 - 96
12345