a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

Preliminary studies of a synthetic approach to the alkaloid stemofoline 1 are reported. Stereoselective cyclisation of the ketoester 14 gave the 1-butyl-2,8-bis(methoxycarbonyl)-8-azabicyclo[3.2.1]octane 21 in which the 2-methoxycarbonyl group is in the axial position. The analogous ketones 15, 18, and 19 were also cyclised to give the 8-azabicyclo[3.2.1]octanes 22-24 with axial electron-withdr...

it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...

in this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. also, density and balanced irregular vague graphs are discussed and some of their properties are established. finally we give an application of vague digraphs.

Results of the bromination and dehydrobromination of several angular methylated decalindiones are described. The key reaction, base-induced cyclization of the monobromo keto ester (3), and the dibromo ketone (4), leads to the formation of tricyclic systems (6) and (9) respectively.

Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...

A series of compounds based on perimidine have been synthesized and evaluated for their DNA-binding properties and antitumor activity. The fused tricyclic permidine chromophore appears to be the minimal structural requirement for intercalative binding to DNA since the mode of binding could be dictated by the position of attachment of the side chain. The intercalating compounds have DNA associat...