WEAK BALANCE IN RANDOM SIGNED GRAPHS

被引:1
|
作者
El Maftouhi, Abdelhakim [1 ]
Harutyunyan, Ararat [1 ]
Manoussakis, Yannis [1 ]
机构
[1] Univ Paris Sud 11, Rech Informat Lab, Bat 650, F-91405 Orsay, France
关键词
D O I
10.1080/15427951.2014.912994
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this article, we strengthen some results in our previous work on balance in random signed graphs and study the weak balance. We show that many of the phenomena observed for the balance of random signed graphs extend to weak balance.
引用
收藏
页码:143 / 154
页数:12
相关论文
共 50 条
  • [1] Balance in Random Signed Graphs
    El Maftouhi, A.
    Manoussakis, Y.
    Megalakaki, O.
    INTERNET MATHEMATICS, 2012, 8 (04) : 364 - 380
  • [2] Balance in random signed intersection graphs
    Papalamprou, Konstantinos
    Raptopoulos, Christoforos
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2019, 75 : 50 - 65
  • [3] BALANCE IN STOCHASTIC SIGNED GRAPHS
    FRANK, O
    HARARY, F
    SOCIAL NETWORKS, 1980, 2 (02) : 155 - 163
  • [4] NOTE ON RANDOM SIGNED GRAPHS
    PHANEENDHRUDU, V
    NATIONAL ACADEMY SCIENCE LETTERS-INDIA, 1979, 2 (07): : 269 - 270
  • [5] Weak signed Roman domination in graphs
    Volkmann, L.
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2020, 5 (02) : 111 - 123
  • [6] A SIMPLE ALGORITHM TO DETECT BALANCE IN SIGNED GRAPHS
    HARARY, F
    KABELL, JA
    MATHEMATICAL SOCIAL SCIENCES, 1980, 1 (01) : 131 - 136
  • [7] Signed random walk diffusion for effective representation learning in signed graphs
    Jung, Jinhong
    Yoo, Jaemin
    Kang, U.
    PLOS ONE, 2022, 17 (03):
  • [8] Strong and weak random walks on signed networks
    S. A. Babul
    Y. Tian
    R. Lambiotte
    npj Complexity, 2 (1):
  • [9] Weak signed Roman k-domination in graphs
    Volkmann, Lutz
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2021, 6 (01) : 1 - 15
  • [10] ENUMERATION OF WEAK ISOMORPHISM-CLASSES OF SIGNED GRAPHS
    SOZANSKI, T
    JOURNAL OF GRAPH THEORY, 1980, 4 (02) : 127 - 144