Version 1
: Received: 3 June 2018 / Approved: 5 June 2018 / Online: 5 June 2018 (08:02:41 CEST)
How to cite:
Baby, S.; Shafiq, M.K.; Naseem, A.; Siddiqui, H.M.A. Bounds for General Connectivity Indices of Tensor Product of Connected Graphs. Preprints2018, 2018060051. https://doi.org/10.20944/preprints201806.0051.v1
Baby, S.; Shafiq, M.K.; Naseem, A.; Siddiqui, H.M.A. Bounds for General Connectivity Indices of Tensor Product of Connected Graphs. Preprints 2018, 2018060051. https://doi.org/10.20944/preprints201806.0051.v1
Baby, S.; Shafiq, M.K.; Naseem, A.; Siddiqui, H.M.A. Bounds for General Connectivity Indices of Tensor Product of Connected Graphs. Preprints2018, 2018060051. https://doi.org/10.20944/preprints201806.0051.v1
APA Style
Baby, S., Shafiq, M.K., Naseem, A., & Siddiqui, H.M.A. (2018). Bounds for General Connectivity Indices of Tensor Product of Connected Graphs. Preprints. https://doi.org/10.20944/preprints201806.0051.v1
Chicago/Turabian Style
Baby, S., Asim Naseem and Hafiz Muhammad Afzal Siddiqui. 2018 "Bounds for General Connectivity Indices of Tensor Product of Connected Graphs" Preprints. https://doi.org/10.20944/preprints201806.0051.v1
Abstract
Topological indices are numerical parameters of a graph which characterize its topology and are usually graph invariant. In this paper, bounds for the Randić, general Randić, sum-connectivity, the general sum-connectivity and harmonic indices for tensor product of graphs are determined by using the combinatorial inequalities and combinatorial computing.
Keywords
tensor product of graphs; Randić index; sum-connectivity index; harmonic index
Subject
Computer Science and Mathematics, Computer Vision and Graphics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
