Abstract

The degree of an edge is defined as the number of edges incident on vertices and other than itself. The Platt number of a graph is the sum of degrees of all its edges. In this paper, the concept of degree of an edge is analysed in social networks. The Platt number is investigated in certain classes of graphs and their total graphs. Also related bounds are proposed on connected graphs. An algorithm developed to determine the Platt number of any connected graph is presented.

Citation details of the article

Journal: International Journal of Applied Mathematics
Journal ISSN (Print): ISSN 1311-1728
Journal ISSN (Electronic): ISSN 1314-8060
Volume: 31
Issue: 5
Year: 2018

DOI: 10.12732/ijam.v31i5.5

Download Section

Download the full text of article from here.

You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.

References

1. [1] J.C. Bermond, J. Bond, M. Paoli, C. Peyrat, Graphs and Interconnection Networks: Diameter and Vulnerability, Cambridge University Press, 2003.
2. [2] F. Buckley, F. Harary, Distance in Graphs, Perseus Books, 1990.
3. [3] F. Harary, Graph Theory, Narosa Publishing House, 2001.
4. [4] I. Gutman, Degree based topological indices, Croat. Chem. Acta, 86, No 4 (2013), 351-361.
5. [5] O. Ore, Diameters in graphs, J. of Combinatorial Theory, 5 (1968), 75-81.
6. [6] J.R. Platt, Influence of neighbour bonds on additive bond properties in paraffins, J. Chem. Phys, 15 (1947), 419-420.
7. [7] J. Thomas, J.V. Kureethara, Decomposition in total graphs, Advanced Modelling and Optimization, 15, No 1 (2013), 81-84.
8. [8] T.A. Mangam, J.V. Kureethara, Diametral paths in total graphs of complete graphs, complete bipartite graphs and wheels, Int. J. Civil Eng. Tech., 8, No 5 (2017), 1212-1219.
9. [9] T.A. Mangam, J.V. Kureethara, Diametral paths in total graphs, Internat. J. of Pure and Appl. Math., 117, No 12 (2017), 273-280.