First, a new proof for the existence of an α-labeling of the quadratic graph Q(3, 4k) is presented. Then the existence of α-labelings of special classes of quadratic graphs with some isomorphic components is shown. 1. Introduction. In this paper, all graphs are finite without loops or multiple edges, and all parameters are positive integers. The symbols |A|, P n , and C n denote the cardi-nalit...

the padmakar-ivan (pi) index is a first-generation topological index (ti) based on sums overall edges between numbers of edges closer to one endpoint and numbers of edges closer to theother endpoint. edges at equal distances from the two endpoints are ignored. an analogousdefinition is valid for the wiener index w, with the difference that sums are replaced byproducts. a few other tis are discu...

Let shape P be any simply-connected set in the plane, bounded by a Jordan curve, that is not a circular disk. We say that a set of points I on the boundary of P immobilize the shape if any rigid motion of P in the plane causes at least one point of I to penetrate the interior of P. We prove that four points always suffice to immobilize any shape. For a large class of shapes, which includes poly...

We consider undirected non-regular connected graphs without loops and multiple edges (other than complete bipartite graphs) which have exactly three distinct eigenvalues (such graphs are called non-standard graphs). The interest in these graphs is motivated by the questions posed by W. Haemers during the 15th British Combinatorial Conference (Stirling, July 1995); the main question concerned th...

The edges of an image define the image boundary. When the image is noisy, it does not become easy to identify the edges. Therefore, a method requests to be developed that can identify edges clearly in a noisy image. Many methods have been proposed earlier using filters, transforms and wavelets with Ant colony optimization (ACO) that detect edges. We here used ACO for edge detection of noisy ima...

The Padmakar-Ivan (PI) index is a first-generation topological index (TI) based on sums over all edges between numbers of edges closer to one endpoint and numbers of edges closer to the other endpoint. Edges at equal distances from the two endpoints are ignored. An analogous definition is valid for the Wiener index W, with the difference that sums are replaced by products. A few other TIs are d...