|
Abstract
|
Suppose that is a graph. The Padmakar-Ivan, vertex Padmakar-Ivan polynomials of a graph are polynomials in one
variable defined for every simple connected graphs that are undirected. Also the Tutte polynomial of is a polynomial in
two variables defined for every undirected graph contains information about how the graph is connected. In this paper, we
compute these polynomials of two infinite classes of dendrimer nanostars.
|