A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs

John Rafael Macalisang Antalan, Francis Joseph Campena


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.


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

Full Text: