On the ψk-polynomial of graph

نویسندگان
doi
چکیده

In this paper, for every k -degree distance we define ψ k -Polynomial of a connected graph G= ( V,E ) as  where ψ k ( i,j ) is the number of edges uv in G such that {d k ( v ) , d k ( u ) }={i,j} and d k ( v ), d k ( u ) are the k th degree distance of v and u, and δ k , ∆ k are the minimum and maximum k th distance degrees respectively. We compute the ψ 2-Polynomial of some standard graphs and some graph operations. Also ψ 2-Polynomial for honeycomb network and Graphene are obtained with their plotting in 3 D .