Lower bounds of forwarding indices of graph products
Résumé
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.
Téléchargements
Les données sur le téléchargement ne sont pas encore disponible.
Publiée
2017-04-23
Numéro
Rubrique
Articles
Copyright (c) 2017 Boletim da Sociedade Paranaense de Matemática
Ce travail est disponible sous licence Creative Commons Attribution - Pas d'Utilisation Commerciale - Pas de Modification 4.0 International.
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).
