Lower bounds of forwarding indices of graph products
Resumo
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
Não há dados estatísticos.
Publicado
2017-04-23
Edição
Seção
Artigos
Copyright (c) 2017 Boletim da Sociedade Paranaense de Matemática

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International 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).