IJPAM: Volume 106, No. 3 (2016)
CONNECTIVITY INDEX OF CERTAIN THORN GRAPHS
M. Jerlin Seles, R. Jayasree, Johan Kok
Department of Mathematics
Nirmala College For Women
Tshwane Metropolitan Police Department
City of Tshwane, REPUBLIC OF SOUTH AFRICA
Abstract. The first three Zagreb indices of a graph denoted, and , are well known. Equally well known is the eccentricity connectivity index denoted, . In this paper we derive closed formula for these indices for thorn cycles, thorn star graphs and thorn complete graphs, respectively. Same is repeated for the eccentricity connectivity index. The further aim of the paper is to emphasize the subtle difference between mathematical induction and immediate induction as equally valid techniques of proof. Valid immediate induction requires the rarely utilised property of many graphs namely, well-defineness.
Received: January 10, 2016
AMS Subject Classification: 05C07, 05C38, 05C75, 05C85
Key Words and Phrases: complete graph, cycle graph, star graph, thorn graph, bushy thorn graph, eccentric connectivity index, Zagreb indices
Download paper from here.
DOI: 10.12732/ijpam.v106i3.16 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 909 - 921