A nonempty set D V of a graph G is a dominating set of G if every vertex in V-D is adjacent to so... more A nonempty set D V of a graph G is a dominating set of G if every vertex in V-D is adjacent to some vertex in D. The domination number (G) is the minimum cardinality taken over all the minimal dominating sets of G. Let D be the minimum dominating set of G. If V-D contains a dominating set D then D is called the Inverse dominating set of G w.r.to D. The Inverse dominating number (G) is the minimum cardinality taken over all the minimal inverse dominating sets of G. A dominating set D of G is a connected dominating set if the induced subgraph <D> is connected. The connected domination number c(G) is the minimum cardinality of a connected dominating set. Unless stated, the graph G has n vertices and m edges. A dominating set D V of a graph G is a split (non-split) dominating set if the induced subgraph <V-D> is disconnected (connected). The split (non-split) domination number s(G) (ns(G)) is the minimum cardinality of a split (non-split) dominating set.
The study on ethanolic extract of leaves of Andrographis paniculata shows that it possesses an an... more The study on ethanolic extract of leaves of Andrographis paniculata shows that it possesses an antioxidant, anti-inflammatory, anti-arthritic and anti-diabetic activity. Ethanolic extract of leaf samples of Andrographis paniculata was qualitatively analysed for the presence of phytochemicals and it was confirmed that the plant extract contain metabolites such as alkaloids, flavonoids, terpenes and steroids. Hence further studies can be carried out using the ethanolic extract of Andrographis paniculata leaves. This study suggests that environmental features have variation in phytochemical content and accumulation in plants. This study provides scientific details to investigate the phytochemicals in the leaves of Andrographis paniculata.
A nonempty set D V of a graph G is a dominating set of G if every vertex in V-D is adjacent to so... more A nonempty set D V of a graph G is a dominating set of G if every vertex in V-D is adjacent to some vertex in D. The domination number (G) is the minimum cardinality taken over all the minimal dominating sets of G. Let D be the minimum dominating set of G. If V-D contains a dominating set D then D is called the Inverse dominating set of G w.r.to D. The Inverse dominating number (G) is the minimum cardinality taken over all the minimal inverse dominating sets of G. A dominating set D of G is a connected dominating set if the induced subgraph <D> is connected. The connected domination number c(G) is the minimum cardinality of a connected dominating set. Unless stated, the graph G has n vertices and m edges. A dominating set D V of a graph G is a split (non-split) dominating set if the induced subgraph <V-D> is disconnected (connected). The split (non-split) domination number s(G) (ns(G)) is the minimum cardinality of a split (non-split) dominating set.
The study on ethanolic extract of leaves of Andrographis paniculata shows that it possesses an an... more The study on ethanolic extract of leaves of Andrographis paniculata shows that it possesses an antioxidant, anti-inflammatory, anti-arthritic and anti-diabetic activity. Ethanolic extract of leaf samples of Andrographis paniculata was qualitatively analysed for the presence of phytochemicals and it was confirmed that the plant extract contain metabolites such as alkaloids, flavonoids, terpenes and steroids. Hence further studies can be carried out using the ethanolic extract of Andrographis paniculata leaves. This study suggests that environmental features have variation in phytochemical content and accumulation in plants. This study provides scientific details to investigate the phytochemicals in the leaves of Andrographis paniculata.
Uploads
Papers by leema mary