A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v14i1.3884Keywords:
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 indexAbstract
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.Downloads
Published
2021-01-31
Issue
Section
Nonlinear Analysis
License
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.
How to Cite
A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs. (2021). European Journal of Pure and Applied Mathematics, 14(1), 248-264. https://doi.org/10.29020/nybg.ejpam.v14i1.3884