Lower bounds of forwarding indices of graph products

Mohamed Amine Boutiche


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.


Forwarding indices; Graph product; subdivision graphs.

Full Text:


DOI: http://dx.doi.org/10.5269/bspm.v37i2.33784

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

ISSN 0037-8712 (print) and ISSN 2175-1188 (on-line)


Resultado de imagem para CC BY