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 |
| id |
oai:animorepository.dlsu.edu.ph:faculty_research-10761 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-107612023-11-02T22:58:12Z A breadth-first search tree construction for multiplicative circulant graphs Antalan, John Rafael M. Campeña, Francis Joseph H. 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. 2021-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/11209 info:doi/10.29020/nybg.ejpam.v14i1.3884 Faculty Research Work Animo Repository Graph theory Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| topic |
Graph theory Mathematics |
| spellingShingle |
Graph theory Mathematics Antalan, John Rafael M. Campeña, Francis Joseph H. A breadth-first search tree construction for multiplicative circulant graphs |
| description |
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. |
| format |
text |
| author |
Antalan, John Rafael M. Campeña, Francis Joseph H. |
| author_facet |
Antalan, John Rafael M. Campeña, Francis Joseph H. |
| author_sort |
Antalan, John Rafael M. |
| title |
A breadth-first search tree construction for multiplicative circulant graphs |
| title_short |
A breadth-first search tree construction for multiplicative circulant graphs |
| title_full |
A breadth-first search tree construction for multiplicative circulant graphs |
| title_fullStr |
A breadth-first search tree construction for multiplicative circulant graphs |
| title_full_unstemmed |
A breadth-first search tree construction for multiplicative circulant graphs |
| title_sort |
breadth-first search tree construction for multiplicative circulant graphs |
| publisher |
Animo Repository |
| publishDate |
2021 |
| url |
https://animorepository.dlsu.edu.ph/faculty_research/11209 |
| _version_ |
1781799769818005504 |