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: | Antalan, John Rafael M., Campeña, Francis Joseph H. |
---|---|
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 |
Similar Items
-
Distance-based topological indices and forwarding indices of circulant graphs
by: Antalan, John Rafael M.
Published: (2021) -
On the fold thickness of graphs
by: Campeña, Francis Joseph H., et al.
Published: (2020) -
On the square of an oriented graph conjecture
by: Campena, Francis Joseph H., et al.
Published: (2016) -
Fold thickness of some graphs
by: Campeña, Francis Joseph H., et al.
Published: (2009) -
A sum labelling for some families of unicyclic graphs
by: Burgos, Jacob Francis C., et al.
Published: (2017)