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 条
  • [1] Optimal Algebraic Breadth-First Search for Sparse Graphs
    Burkhardt, Paul
    [J]. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2021, 15 (05)
  • [2] Breadth-first search
    Swaine, M
    [J]. DR DOBBS JOURNAL, 2000, 25 (06): : 100 - +
  • [3] Breadth-first heuristic search
    Zhou, R
    Hansen, EA
    [J]. ARTIFICIAL INTELLIGENCE, 2006, 170 (4-5) : 385 - 408
  • [4] Breadth-First Search on Dynamic Graphs using Dynamic Parallelism on the GPU
    Toedling, Dominik
    Winter, Martin
    Steinberger, Markus
    [J]. 2019 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2019,
  • [5] A method of characterizing network topology based on the breadth-first search tree
    Zhou, Bin
    He, Zhe
    Wang, Nianxin
    Wang, Bing-Hong
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 450 : 682 - 686
  • [6] Efficient Breadth-First Reduct Search
    Boonjing, Veera
    Chanvarasuth, Pisit
    [J]. MATHEMATICS, 2020, 8 (05)
  • [7] Parallel breadth-first BDD construction
    Yang, B
    OHallaron, DR
    [J]. ACM SIGPLAN NOTICES, 1997, 32 (07) : 145 - 156
  • [8] A compressed breadth-first search for satisfiability
    Motter, DRB
    Markov, IL
    [J]. ALGORITHM ENGINEERING AND EXPERIMENTS, 2002, 2409 : 29 - 42
  • [9] Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
    Crespelle, Christophe
    Gambette, Philippe
    [J]. INFORMATION PROCESSING LETTERS, 2010, 110 (12-13) : 497 - 502
  • [10] Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search
    Crespelle, Christophe
    Gambette, Philippe
    [J]. COMBINATORIAL ALGORITHMS, 2009, 5874 : 146 - +
12345