Diametral paths in total graphs of complete graphs, complete bipartite graphs and wheels

Title

Diametral paths in total graphs of complete graphs, complete bipartite graphs and wheels

Creator

Mangam T.A.; Kureethara J.V.

Description

The diametral path of a graph is the shortest path between two vertices which has length equal to diameter of that graph. In raising of structures with columns and beams in Civil Engineering, determining of diametral paths is of great significance. In this paper, the number of diametral paths is determined in complete graphs, complete bipartite graphs, wheels and their total graphs. IAEME Publication.

Source

International Journal of Civil Engineering and Technology, Vol-8, No. 5, pp. 1212-1219.

Date

2017-01-01

Publisher

IAEME Publication

Subject

Central vertex; Diameter; Diametral path; Peripheral vertex; Total graph

Coverage

Mangam T.A., Department of Mathematics, Christ University, Bengaluru, Karnataka, India; Kureethara J.V., Department of Mathematics, Christ University, Bengaluru, Karnataka, India

Rights

Restricted Access

Relation

ISSN: 9766308

Format

Online

Language

English

Type

Article

Identifier

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021654143&partnerID=40&md5=a9a070e9d5a0ad10b7a45cd2b6a7a712