A note on a walk-based inequality for the index of a signed graph

被引:2
|
作者
Stanic, Zoran [1 ]
机构
[1] Univ Belgrade, Fac Math, Studentski Trg 16, Belgrade 11000, Serbia
来源
SPECIAL MATRICES | 2021年 / 9卷 / 01期
关键词
Signed graph; walk; adjacency matrix; index; upper bound; LARGEST EIGENVALUE;
D O I
10.1515/spma-2020-0120
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.
引用
收藏
页码:19 / 21
页数:3
相关论文
共 50 条
  • [1] Random walk-based ranking in signed social networks: model and algorithms
    Jung, Jinhong
    Jin, Woojeong
    Kang, U.
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2020, 62 (02) : 571 - 610
  • [2] Random walk-based ranking in signed social networks: model and algorithms
    Jinhong Jung
    Woojeong Jin
    U Kang
    [J]. Knowledge and Information Systems, 2020, 62 : 571 - 610
  • [3] Adaptive graph walk-based similarity measures for parsed text
    Minkov, Einat
    Cohen, William W.
    [J]. NATURAL LANGUAGE ENGINEERING, 2014, 20 (03) : 361 - 397
  • [4] Incorporating Discrete Constraints Into Random Walk-Based Graph Matching
    Yang, Xu
    Liu, Zhi-Yong
    Qiao, Hong
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2020, 50 (04): : 1406 - 1416
  • [5] Walk-based measure of balance in signed networks: Detecting lack of balance in social networks
    Estrada, Ernesto
    Benzi, Michele
    [J]. PHYSICAL REVIEW E, 2014, 90 (04):
  • [6] Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity
    Minello, Giorgia
    Rossi, Luca
    Torsello, Andrea
    [J]. ENTROPY, 2019, 21 (03)
  • [7] A Deep Dive Into Understanding The Random Walk-Based Temporal Graph Learning
    Talati, Nishil
    Jin, Di
    Yet, Haojie
    Brahmakshatriya, Ajay
    Dasika, Ganesh
    Amarasinghe, Saman
    Mudge, Trevor
    Koutra, Danai
    Dreslinski, Ronald
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON WORKLOAD CHARACTERIZATION (IISWC 2021), 2021, : 87 - 100
  • [8] A Note on an Inequality Between Energy and Sombor Index of a Graph
    Akbari, Saieed
    Habibi, Mohammad
    Rouhani, Soheyr
    [J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2023, 90 (03) : 765 - 771
  • [9] Estimating Walk-Based Similarities Using Random Walk
    Murai, Shogo
    Yoshida, Yuichi
    [J]. WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 1321 - 1331
  • [10] HIGH-LEVEL FEATURE EXTRACTION USING SVM WITH WALK-BASED GRAPH KERNEL
    Vert, Jean-Philippe
    Matsui, Tomoko
    Satoh, Shin'ichi
    Uchiyama, Yuji
    [J]. 2009 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS 1- 8, PROCEEDINGS, 2009, : 1121 - +