KRYSTYNA MICHALAK* , ANDRZEJ B. HENDRICH, OLGA WESOł OWSKA, ANDRZEJ POł A, BARBARA ł ANIA-PIETRZAK, NOBORU MOTOHASHI, YOSHIAKI SHIRATAKI and JOSEPH MOLNAR Department of Biophysics, Wroc–aw Medical University, Wroc–aw, Poland, Department of Medicinal Chemistry, Meiji Pharmaceutical University, Tokyo, Japan, Faculty of Pharmaceutical Sciences, Josai University, Keyakidai, Sakado, Saitama, Japan, ...

a lot of research and various techniques have been devoted for finding the topologicaldescriptor wiener index, but most of them deal with only particular cases. there exist threeregular plane tessellations, composed of the same kind of regular polygons namely triangular,square, and hexagonal. using edge congestion-sum problem, we devise a method to computethe wiener index and demonstrate this m...

Ákos Kristóf CSETE, Ronald András KOLCSÁR & Ágnes GULYÁS - RAINWATER HARVESTING POTENTIAL AND VEGETATION IRRIGATION ASSESSMENT DERIVED FROM BUILDING DATA-BASED HYDROLOGICAL MODELING THROUGH THE CASE STUDY OF SZEGED, HUNGARY, Carpathian Journal of Earth and Environmental Sciences, August 2021, Vol. 16, No. 2, p. 469 – 482; DOI:10.26471/cjees/2021/016/192

Let (G,w) be a network, that is, a graph G = (V (G), E(G)) together with the weight function w : E(G) → R. The Szeged index Sz(G,w) of the network (G,w) is introduced and proved that Sz(G,w) ≥ W (G,w) holds for any connected network where W (G,w) is the Wiener index of (G,w). Moreover, equality holds if and only if (G,w) is a block network in which w is constant on each of its blocks. Analogous...

e=uv∈E(nu(e)+n0(e)/2)(nv(e)+n0(e)/2), where nu(e) and nv(e) are, respectively, the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u, and n0(e) is the number of vertices equidistant to u and v. Hansen used the AutoGraphiX and made the following conjecture about the revised Szeged index for a connected bicy...

‎this paper obtains the exact solutions of the wave equation as a second-order partial differential equation (pde)‎. ‎we are going to calculate polynomial and non-polynomial exact solutions by using lie point symmetry‎. ‎we demonstrate the generation of such polynomial through the medium of the group theoretical properties of the equation‎. ‎a generalized procedure for polynomial solution is pr...

the omega polynomial(x) was recently proposed by diudea, based on the length of stripsin given graph g. the sadhana polynomial has been defined to evaluate the sadhana index ofa molecular graph. the pi polynomial is another molecular descriptor. in this paper wecompute these three polynomials for some infinite classes of nanostructures.

in this paper, we show how certain metabelian groups can be found within polynomial evaluation groupoids. we show that every finite abelian group can beobtained as a polynomial evaluation groupoid.