DISTANCE τ-POLYNOMIAL AND EDGE DISTANCE τ-POLYNOMIAL OF GRAPHS

DISTANCE τ-POLYNOMIAL AND EDGE DISTANCE τ-POLYNOMIAL OF GRAPHS

V. Mathad, M. Pavithra

[PDF]

Abstract

The distance τ -polynomial D(G, x) of a graph G = (V,E) is defined as D(G, x) = (n 2)X k=0 τkxk, where τk is the number of vertices with τG(u) = X x∈V (G) dG(u, x) = k, ∀u ∈ V (G). In this paper, we seek to find the distance τ -polynomial and similarly, edge distance τ -polynomial of some graph families and graph operations.

Keywords

closeness centrality, edge closeness centrality, distance τ-polynomial, edge distance τ -polynomial.