GRAPHS AND TOPOLOGIES ON DISCRETE SETS

被引:5
|
作者
PREA, P [1 ]
机构
[1] FAC SCI LUMINY,DEPT MATH & INFORMAT,API,F-13009 MARSEILLE,FRANCE
关键词
D O I
10.1016/0012-365X(92)90269-L
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that a graph admits a topology on its node set which is compatible with the usual connectivity of undirected graphs if, and only if, it is a comparability graph. Then, we give a similar condition for the weak connectivity of oriented graphs and show there is no topology which is compatible with the strong connectivity of oriented graphs. We also give a necessary and sufficient condition for a topology on a discrete set to be 'representable' by an undirected graph.
引用
收藏
页码:189 / 197
页数:9
相关论文
共 50 条
  • [41] Geodetic sets and Steiner sets in graphs
    Tong, Li-Da
    DISCRETE MATHEMATICS, 2009, 309 (12) : 4205 - 4207
  • [42] On dominating sets and independent sets of graphs
    Harant, J
    Pruchnewski, A
    Voigt, M
    COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (06): : 547 - 553
  • [43] Instability of discrete point sets]{Instability of discrete point sets
    Achill Schürmann
    Periodica Mathematica Hungarica, 2006, 53 (1-2) : 257 - 264
  • [44] Independent sets in graphs
    Dainyak, Aleksandr B.
    Sapozhenko, Aleksandr A.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2016, 26 (06): : 323 - 346
  • [45] On homometric sets in graphs
    Axenovich, Maria
    Oezkahya, Lale
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2013, 55 : 175 - 187
  • [46] Balanced Sets in Graphs
    Haynes, Teresa W.
    Hedetniemi, Stephen T.
    Scott, Hamilton
    UTILITAS MATHEMATICA, 2014, 93 : 343 - 356
  • [47] LINKING OF SETS IN GRAPHS
    PYM, JS
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY, 1969, 44 (175P): : 542 - &
  • [48] EFFICIENT SETS IN GRAPHS
    BERNHARD, PJ
    HEDETNIEMI, ST
    JACOBS, DP
    DISCRETE APPLIED MATHEMATICS, 1993, 44 (1-3) : 99 - 108
  • [49] On Gated Sets in Graphs
    Changat, Manoj
    Peterin, Iztok
    Ramachandran, Abisha
    TAIWANESE JOURNAL OF MATHEMATICS, 2016, 20 (03): : 509 - 521
  • [50] Nondeficient Sets in Graphs
    Arumugam, S.
    Kumar, R. Anantha
    Rao, S. B.
    UTILITAS MATHEMATICA, 2018, 109 : 181 - 195