the wiener polarity index wp(g) of a molecular graph g of order n is the number ofunordered pairs of vertices u, v of g such that the distance d(u,v) between u and v is 3. in anearlier paper, some extremal properties of this graph invariant in the class of catacondensedhexagonal systems and fullerene graphs were investigated. in this paper, some new bounds forthis graph invariant are presented....

the mathematical properties of nano molecules are an interesting branch of nanoscience forresearches nowadays. the periodic open single wall tubulene is one of the nano moleculeswhich is built up from two caps and a distancing nanotube/neck. we discuss how toautomatically construct the graph of this molecule and plot the graph by spring layoutalgorithm in graphviz and netwrokx packages. the sim...

The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...

the tutte polynomial of a graph g, t(g, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. in this paper a simple formula for computing tutte polynomial of a benzenoid chain is presented.

Convolutional neural networks (CNNs), in a few decades, have outperformed the existing state of art methods classification context. However, way they were formalised, CNNs are bound to operate on euclidean spaces. Indeed, convolution is signal operation that defined This has restricted deep learning main use euclidean-defined data such as sound or image. And yet, numerous computer application f...