Document Type : Original Research Article
Authors
1 Department of Studies in Mathematics University of Mysore, Manasagangotri Mysuru-570 006, India
2 Department of Mathematics, University of Aden, Yemen
3 Department of Applied Mathematics, Iran University of Science and Technology (IUST), Narmak, Tehran 16846, Iran
Abstract
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 {dk(v), dk(u)}={i,j} and dk(v), dk(u) are the kth degree distance of v and u, and δk, ∆k are the minimum and maximum kth 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 3D.
Graphical Abstract
Keywords
Main Subjects