The investigation was carried out to determine the possible phytochemical constituents from aqueous, methanol and chloroform extracts of Turnera subulata leaf extracts. Among the phytochemical screening of these extracts, Methanolic extract showed that the leaf was rich in alkaloids, flavonoids, glycosides, phenols, saponins and quinones. The chemical composition of the plant leaf extract of T. subulata was investigated using Gas Chromatography – Mass Spectroscopy (Agilent-7890A GC instrument coupled with MS-5975) and NIST-MS library. GC-MS analysis of T. subulata plant leaf extract, revealed the existence of the GC-MS chromatogram of the major peaks presented in methanolic extract like Methyl 8,11,14-heptadecatrienoate (23.244%), Pentadecanoic acid, 14-methyl-,methyl ester (8.654%), n-Hexadecanoic acid (8.654%), 4H-Pyran4-one, 2,3-dihydro-3,5-dihydroxy-6-methyl (6.598%), 1b,4a-Epoxy-2H-cyclopenta[3,4] cyclopropa[8,9]cycloundec[1,2-b] oxiren-5(1aH)-one(5.400%), 3,7,11,15-Tetramethyl-2-hexadecen-1- ol(5.400%), etc. From this study it is obvious that T. subulata leaf extract contains many biologically active compounds and also it gives a detailed insight about the phytochemical profile which could be exploited for the development of plant based drug.

No abstract

Let G be a simple connected graph of order n. Let D ct (G, i) be the family of connected total dominating sets in G with cardinality i. The polynomial D ct (G, x) = n i (G) ct   2 n P of cardinality i and some properties of this polynomial have been studied.

No abstract

For a connected graph G = (V, E), a set S ⊆ E is called an edge-to-vertex geodetic set of G if every vertex of G is either incident with an edge of S or lies on a geodesic joining a pair of edges of S. The minimum cardinality of an edge-to-vertex geodetic set of G is g ev (G). Any edge-to-vertex geodetic set of cardinality g ev (G) is called an edge-to-vertex geodetic basis of G. A subset T ⊆ S is called a forcing subset for S if S is the unique minimum edge-to-vertex geodetic set containing T . A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing edge-to-vertex geodetic number of S, denoted by f ev (S), is the cardinality of a minimum forcing subset of S. The forcing edge-to-vertex geodetic number of G, denoted by f ev (G), is f ev (G) = min {f ev (S)}, where the minimum is taken over all minimum edgeto-vertex geodetic sets S in G. Some general properties satisfied by the concept forcing edge-to-vertex geodetic number is studied. The forcing edge-to-vertex geodetic number of certain classes of graphs are determined. It is shown that