The computer code developed previously (K. Balasubramanian, J . Computational Chern., 5,387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and signed graphs. This extension leads to a number of important applications of this code to several ...

The article mainly studies the contracting similarity fixed point and the structure of the general Sierpinski gasket. Firstly, the paper analyzes the importance of contracting similarity fixed point in fractal geometry. Based on a series of definitions, the article studies the contracting similarity fixed point. Then, the paper researches on the structure of the general Sierpinski gasket, and d...

This paper investigates the application of novelty detection techniques to the problem of drug profiling in forensic science. Numerous one-class classifiers are tried out, from the simple k-means to the more elaborate Support Vector Data Description algorithm. The target application is the classification of illicit drugs samples as part of an existing trafficking network or as a new cluster. A ...