Lower bounds of forwarding indices of graph products
DOI:
https://doi.org/10.5269/bspm.v37i2.33784Keywords:
Forwarding indices, Graph product, subdivision graphs.Abstract
In this paper, we give lower bounds of vertex and edge forwarding indices for cartesian product, join, composition, disjunction and symmetric difference of graphs. Moreover, we derive further lower bounds for several operators on connected graphs, such as subdivision graph and total graphs.
Downloads
Published
2017-04-23
Issue
Section
Research Articles
License
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).
