A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs

Authors

DOI:

https://doi.org/10.29020/nybg.ejpam.v14i1.3884

Keywords:

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

Abstract

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

Vol. 14 No. 1: (January 2021)

Section

Nonlinear Analysis

License

Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.

By agreeing to this statement, you acknowledge that:

  • You retain full copyright over your work.
  • The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
  • This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.

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