A breadth-first search tree construction for multiplicative circulant graphs
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 spectra...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2021
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/11209 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | 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. |
|---|