A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs

被引：1
|
作者：
Antalan, John Rafael M. [1 ,2 ]
Campena, Francis Joseph H. [2 ]
机构：
[1] Cent Luzon State Univ, Coll Sci, Dept Math & Phys, Sci City Of Munoz 3120, Nueva Ecija, Philippines
[2] De La Salle Univ, Coll Sci, Math & Stat Dept, 2401 Taft Ave, Manila 1004, Metro Manila, Philippines
来源：
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2021年 / 14卷 / 01期
关键词：
Breadth-first search tree; multiplicative circulant graph; graph distance matrix; graph diameter; graph distance spectral radius; graph average distance; Wiener index; graph edge-forwarding index; graph vertex-forwarding index; NETWORKS; INDEXES;
D O I：
10.29020/nybg.ejpam.v14i1.3884
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we give a recursive method in constructing a breadth-first search tree for multiplicative circulant graphs of order power of odd. We then use the proposed construction in reproving some results concerning multiplicative circulant graph's diameter, average distance and distance spectral radius. We also determine the graph's Wiener index, vertex-forwarding index, and a bound for its edge-forwarding index. Finally, we discuss some possible research works in which the proposed construction can be applied.
引用
收藏
页码：248 / 264
页数：17
相关论文
共 50 条
  • [31] Deep Learning Aided Low Complex Breadth-First Tree Search for MIMO Detection
    Liao, Jieyu
    Zhao, Junhui
    Gao, Feifei
    Li, Geoffrey Ye
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2024, 23 (06) : 6266 - 6278
  • [32] Reduced-Complexity MIMO Detection via a Slicing Breadth-First Tree Search
    Suh, Sangwook
    Barry, John R.
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (03) : 1782 - 1790
  • [33] Parallelization of enumerating tree-like chemical compounds by breadth-first search order
    Morihiro Hayashida
    Jira Jindalertudomdee
    Yang Zhao
    Tatsuya Akutsu
    [J]. BMC Medical Genomics, 8
  • [34] An adaptive breadth-first search algorithm on integrated architectures
    Zhang, Feng
    Lin, Heng
    Zhai, Jidong
    Cheng, Jie
    Xiang, Dingyi
    Li, Jizhong
    Chai, Yunpeng
    Du, Xiaoyong
    [J]. JOURNAL OF SUPERCOMPUTING, 2018, 74 (11): : 6135 - 6155
  • [35] EFFICIENT ALGORITHMS FOR FINDING DEPTH-FIRST AND BREADTH-FIRST SEARCH-TREES IN PERMUTATION GRAPHS
    RHEE, C
    LIANG, YD
    DHALL, SK
    LAKSHMIVARAHAN, S
    [J]. INFORMATION PROCESSING LETTERS, 1994, 49 (01) : 45 - 50
  • [36] Evaluation and Optimization of Breadth-First Search on NUMA Cluster
    Cui, Zehan
    Chen, Licheng
    Chen, Mingyu
    Bao, Yungang
    Huang, Yongbing
    Lv, Huiwei
    [J]. 2012 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING (CLUSTER), 2012, : 438 - 448
  • [37] Distributed breadth-first search LTL model checking
    Barnat, Jiri
    Cerna, Ivana
    [J]. FORMAL METHODS IN SYSTEM DESIGN, 2006, 29 (02) : 117 - 134
  • [38] A breadth-first search applied to the minimization of the open stacks
    Moreira de Carvalho, Marco Antonio
    Soma, Nei Yoshihiro
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (06) : 936 - 946
  • [39] Implementing Breadth-First Search on a compact supercomputer Suiren
    Mitsuishi, Takuji
    Kaneda, Takahiro
    Torii, Sunao
    Amano, Hideharu
    [J]. 2016 FOURTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2016, : 395 - 401
  • [40] Semi-dynamic breadth-first search in digraphs
    Franciosa, PG
    Frigioni, D
    Giaccio, R
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 250 (1-2) : 201 - 217
12345