A breadth-first search tree construction for multiplicative circulant graphs

College

College of Science

Department/Unit

Mathematics and Statistics Department

Document Type

Article

Source Title

European Journal of Pure and Applied Mathematics

Volume

14

Issue

1

First Page

248

Last Page

264

Publication Date

2021

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.

html

Digitial Object Identifier (DOI)

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

Disciplines

Mathematics

Keywords

Graph theory

Upload File

wf_no

This document is currently not available here.

Share

COinS