Thakkar, D. K.; Jamvecha, Neha P.(Mathematical and Statistical Sciences, 2018)
In this paper, we have defined the concepts of m-independent set, maximal m-independent set and maximum m-set. In order to define these concepts we have used the notion of m-adjacent vertices. Adjacent vertices are ...
Thakkar, D. K.; Jamvecha, P.(Malaya Journal of Matematik, 2020)
In this paper, we have defined the concepts of ve-quasi independent set and secured ve-quasi independent set. In order to define these concepts we have used the concept of a vertex which m-dominates an edge. We prove a ...
Vaidya, S. K.; Parmar, A. D.(Malaya Journal of Matematik, 2019)
A dominating set D of a graph G is called total if every vertex of V (G) is adjacent to at least one vertex of D,
equivalently if N(D) = V (G) then D is called total dominating set. A dominating set D is called total ...
Vaidya, S. K.; Parmar, A. D(Journal of Scientific Research, 2019)
The bondage number of a nonempty graph is the minimum cardinality among all sets of edges for which. An equitable dominating set is called a total equitable dominating set if the induced subgraph has no isolated vertices. ...
Mao, L.(International Journal of Mathematical Combinatorics, 2019)
The mathematical combinatorics is a subject that applying combinatorial
notion to all mathematics and all sciences for understanding the reality of things in the universe,
motivated by CC Conjecture of Dr.Linfan MAO on ...
Vaidya, S. K.; Parmar, A. D(Malaya Journal of Matematik, 2019)
A proper k - coloring of a graph G is a function f : V (G) → {1, 2, ..., k} such that f (u) 6 = f (v) for all uv ∈ E(G). The
color class Si is the subset of vertices of G that is assigned to color i. The chromatic number ...
Vaidya, S. K; Parmar, A. D.(Malaya Journal of Matematik, 2019)
A subset S of vertices of G is an open packing of G if the open neighborhoods of the vertices of S are pairwise disjoint
in G while open packing number of G is the maximum cardinality among all the open packing sets of ...
Vaidya, S. K.; Parmar, A. D.(Journal of Applied Science and Computations, 2019)
A subset S of vertices of G is an open packing of G if the open neighborhoods of the vertices of S are pairwise disjoint in G while open packing number of G is the maximum cardinality among all the open packing sets of G. ...
Vaidya, S. K.; Parmar, A. D.(Journal of Scientific Research, 2018)
If for any total dominating set D with v∈V(G) - D there exists a vertex u ∈ D such that uv∈E(G) and |d(v) - d(u)|≤ 1 then D is called the total equitable dominating set. The minimum cardinality of the total equitable ...
S. K., Vaidya; Ajani, P. D.(JOURNAL OF SCIENTIFIC RESEARCH, 2021)
For a graph, a set is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in The minimum cardinality of a restrained ...
Vaidya, S. K.; Ajani, P. D.(Malaya Journal of Matematik, 2020)
A dominating set is said to be a restrained dominating set of graph if every vertex not in is adjacent to a vertex in and also to a vertex in . A set is called an equitable dominating set if for every vertex , there exist ...
Vaidya, S. K.; Ajan, P. D.(Malaya Journal of Matematik, 2020)
For a graph G = (V, E), a subset D of E is restrained edge dominating set of G if every edge not in D is adjacent
to an edge in D as well as an edge in E − D. The restrained edge domination number of G, denoted by γre(G)
is ...
S. K., Vaidya; Ajani, P. D.(Malaya Journal of Matematik, 219)
For a graph G = (V, E), a set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in
S and also to a vertex in V − S. The minimum cardinality of a restrained dominating set of G is called ...
Vaidya, S.K .; Ajani, P D(International Journal of Mathematics and Soft Computing, 2018)
For a graph G = (V, E), a set S ⊆ V is a restrained dominating set if every vertex not in S
is adjacent to a vertex in S and to a vertex in V − S. The smallest cardinality of a restrained
dominating set of G is called ...
Sadalage, N. A.; Baidya, M.; Kondrapu, P.; Ghiware, N.; Shaha, A. P.; Mayur, S.; Rajput, S. M.(Eur. Chem. Bull., 2023)
In the current study, the total phenolic and flavonoid content, antioxidant activities, and antidiabetic activity of several leaf extracts from Acacia nilotica were assessed. Analysis of the extracts' phytochemical composition ...
Numerous diversity-oriented synthesis of tetrazole heterocycles have
been demonstrated but most of them are based on point diversity
within the same library and usually include slow sequential multistep
synthesis, which ...
Shah, P.; Hadiyal, S.; Dhaduk, B.(Results in Chemistry, 2023)
Selexipag belongs to a class of medicines known as IP prostacyclin receptor agonists used to treat pulmonary arterial hypertension. A simple and sensitive LC-MS/MS method has been developed for the identification of process ...
Panchal, J.; Dhaduk, B.; Dhalani, J.(Rasayan Journal of Chemistry, 2023)
Remogliflozin and Vildagliptin are the latest drug combination in order to treat type 2 diabetes. The present work describes a comparative study of 2nd-ordered derivative UV and isocratic stability indicating RP-HPLC methods ...
Kapadiya, K .; Pandya, M.; Rathod, C.; Dhalani, J.; Dhaduk, B.(Journal of Scientific & Industrial Research, 2018)
In an attempt to design and synthesize a new class of anticancer molecules, we have reported coupling of aryl aldehyde, p-toluidine and morpholine based isocyanide with cyclopropane carboxylic acid to generate a small ...
Limbani, Vidhi; Godhasara, Bhagyashree; Jani, Foram; Dhaduk, Bhavin B.(nternational Journal of Scientific Research and Reviews, 2019)
1,1’-bis(3-methyl-4-hydroxyphenyl)cyclohexane (MEBC) was synthesized by acid-catalysed condensation. The structure of compound was supported by 1H NMR and 13C NMR. The purity and mass of the compound can be confirmed by ...