Platt number of total graphs

Title

Platt number of total graphs

Creator

Belavadi M.M.; Mangam T.A.

Description

The degree of an edge uv is defined as the number of edges incident on vertices u and v 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. 2018 Academic Publications.

Source

International Journal of Applied Mathematics, Vol-31, No. 5, pp. 593-602.

Date

2018-01-01

Publisher

Academic Publications Ltd.

Subject

Central vertices; Diameter; Peripheral vertices; Platt number; Total graph

Coverage

Belavadi M.M., CHRIST (Deemed to be University), Department of Mathematics and Statistics, Bengaluru, 560029, India; Mangam T.A., CHRIST (Deemed to be University), Department of Mathematics and Statistics, Bengaluru, 560029, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 13111728

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.12732/ijam.v31i5.5

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85067662706&doi=10.12732%2fijam.v31i5.5&partnerID=40&md5=d0fd80cb559d0364c27e7c22aab031de