Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 1

Pendent vertex Related Publications

1 Terminal Wiener Index for Graph Structures

Authors: J. Baskar Babujee, J. Senbagamalar

Abstract:

The topological distance between a pair of vertices i and j, which is denoted by d(vi, vj), is the number of edges of the shortest path joining i and j. The Wiener index W(G) is the sum of distances between all pairs of vertices of a graph G. W(G) = i

Keywords: Distance, tree, graph, degree, wiener index, Pendent vertex

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1721