The Wiener index of a graph W(G) is well studied topological for graphs. An outstanding problem Šoltés to find graphs G such that W(G)=W(G−v) all vertices v∈V(G), with the only known example being G=C11. We relax this by defining notion indices signed graphs, which we denote Wσ(G), and under relaxation construct many Wσ(G)=Wσ(G−v) v∈V(G). This ends up related independent interest, asks when it ...

The expensive and time-consuming process of drug lead discovery is significantly accelerated by efficiently screening molecular libraries with a high structural diversity and selecting subsets of molecules according to their similarity toward specific collections of active compounds. To characterize the molecular similarity/diversity or to quantify the drug-like character of compounds the proce...

In this paper, a novel de-blocking algorithm is proposed, using block wiener filtering, shift and weighted average operations. The of block boundary occurs by a mixture of the shift and average operations. However, visually annoying artifacts are visible around the edge region in highly compressed images. In the proposed method, the wiener attenuation coefficients are given based on the expecte...

Complex networks abound in physical, biological and social sciences. Quantifying a network's topological structure facilitates network exploration and analysis, and network comparison, clustering and classification. A number of Wiener type indices have recently been incorporated as distance-based descriptors of complex networks, such as the R package QuACN. Wiener type indices are known to depe...