Open AccessA Breadth-first Search Tree Construction for Multiplicative Circulant Graphs
Author(s) -
John Rafael M. Antalan,
Francis Joseph H. Campeña
Publication year - 2021
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v14i1.3884
Subject(s) - mathematics , circulant matrix , multiplicative function , combinatorics , circulant graph , spectral radius , vertex (graph theory) , wiener index , discrete mathematics , graph , line graph , graph power , eigenvalues and eigenvectors , mathematical analysis , physics , quantum mechanics
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.