Lower bounds of forwarding indices of graph products
Resumen
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.
Descargas
La descarga de datos todavía no está disponible.
Publicado
2017-04-23
Número
Sección
Articles
Derechos de autor 2017 Boletim da Sociedade Paranaense de Matemática
Esta obra está bajo licencia internacional Creative Commons Reconocimiento-NoComercial-SinObrasDerivadas 4.0.
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).
