02. Faculty of Science: Recent submissions

  • Synthesis and antimicrobial activity of 2-{[(4’-arylidine-5’oxo-2’ phenyl) imidazolyl]-1’-Yl}-3-keto-1,5-dimethyl-2-phenyl pyrazole 
    Vagadiya, G.V.; Purohit, D.M.; Koradiya, S.B. (Journal of Applicable Chemistry, 2019)
    5-Oxo-imidazoline derivatives exhibited good therapeutic activity, with a view of getting to synthesis 2-{[(4’-arylidine-5’oxo-2’phenyl) imidazolyl]-1’-yl}-3-keto-1,5-dimethyl-2-phenyl pyrazole (1a–1n) have been ...
  • Facile synthesis of (E)-5-styrylpyrimidines via wittig reaction using sodium tripolyphosphate in water 
    Patel, Anilkumar S.; Gandhi, Sahaj A.; Modh, Rajesh D.; Patel, Urmila H.; Naliapara, Yogesh T.; Kapuriya, Naval P. (Letters in Organic Chemistry, Bentham Science Publishers, 2021)
    An inexpensive and eco-friendly Wittig olefination protocol has been developed to prepare novel (E)-5-styrylpyrimidines. The reaction of pyrimidine phosphonium ylide with different aryl/heteroaryl aldehydes underwent ...
  • Synthesis of pyrrole derivatives via cycloaddition reaction of reissert hydrofluoroborate salts with α-bromoacrylamides 
    Rathod, Chirag H.; Patel, Anilkumar S. (Analytical Chemistry Letters, Taylor & Francis, 2021)
    An investigation of α-bromoacrylamide as a dienophile for the cycloaddition reaction of Reissert hydrofluoroborate salt of quinoline/phenanthridine has been carried out. The optimized condition has been developed for ...
  • Bioconversion of Floral Waste into Biocompost by using Microbial Consortium from Cow Dung 
    Gorasiya, Tejas; Faldu, Nilkanth (Current Agriculture Research Journal, 2022-12-05)
    In the majority of the developing nations like India, the flower waste age happens to a great extent during capacities, loves, services, celebrations, and so on. Debasement of floral waste is an extremely sluggish interaction. ...
  • Exploring Floral Waste into Bio-compost using Microbial Consortium from cow dung: A Review 
    Gorasiya, Tejas; Faldu, Nilkanth (Sustainability, Agri, Food and Environmental Research, 2023-01-25)
    India being a cultural nation with pilgrimage and deities activities as well an arena of myriad social and cultural functional events, leads to floral waste generation as a natural inevitable outcome with a very slow ...
  • Correlation study between “structure and commencement temperature” of nematogenic mesomorphs having Azo-Ester linkage 
    Baku, Neha K.; Cholera, Archana Y.; Travadi, J.J. (World Scientific News, 2023-03-02)
    Correlation study between ‘commencement of Nematic Transition Temperature (NTT)’ and their ‘structural property data set’ is carry out. Stepwise backward regression analysis method is applied to find out good correlation ...
  • Restrained edge domination number of some path related graphs 
    Vaidya, S.K.; Ajani, P.D. (Journal of Scientific Research, 2021)
    For a graph G=(V, E), a set S⊆ V (S⊆ E) 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 V-S (ES). The ...
  • Equitable restrained domination number of some graphs 
    Vaidya, S.K.; Ajani, P.D. (Malaya Journal of Matematik, 2020)
    A dominating set S ⊆ V is said to be a restrained dominating set of graph G if every vertex not in S is adjacent to a vertex in S and also to a vertex in V − S. A set S ⊆ V is called an equitable dominating set if for ...
  • On restrained edge dominating set of graphs 
    Vaidya, S.K.; Ajani, 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 ...
  • On restrained domination number of some wheel related graphs 
    Vaidya, S.K.; Ajani, P.D. (Malaya Journal of Matematik, 2019)
    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 ...
  • On restrained domination number of graphs 
    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 ...
  • Restrained domination number of some path related graphs 
    Vaidya, S.K.; Ajani, P.D. (Journal of Computational Mathematica, 2017)
    A dominating set S ⊆ V (G)of a graph G is called restrained dominating set if every vertex in V (G) - S is adjacent to a vertex in S and to a vertex in V (G) - S. The restrained domination number of G, denoted by γ_r (G), ...
  • Some new classes of equienergetic graphs 
    Popat, Kalpesh M. (South East Asian Journal of Mathematics and Mathematical Sciences, 2022-08-30)
    The eigenvalue of a graph G is the eigenvalue of its adjacency matrix and the energy E (G) of graph G is the sum of absolute values of its eigenvalues. Two non-isomorphic graphs G1 and G2 of the same order are said to be ...
  • Construction of L-equienergetic graphs using some graph operations 
    Vaidya, S.K.; Popat, Kalpesh M. (AKCE International Journal of Graphs and Combinatorics, Taylor & Francis, 2020)
    For a graph G with n vertices and m edges, the eigenvalues of its adjacency matrix A (G) are known as eigenvalues of G. The sum of absolute values of eigenvalues of G is called the energy of G. The Laplacian matrix of G ...
  • Spectra of graphs obtained by duplication of graph elements 
    Vaidya, Samir K.; Popat, Kalpesh M. (Mathematics Today, 2019-12)
    The concept of graph energy is a frontier between two important branches of basic sciences: namely, Mathematics and Chemistry. The sum of absolute values of eigenvalues of adjacency matrix of graph is called the energy ...
  • Construction of sequence of borderenergetic graphs 
    Vaidya, S.K.; Popat, K.M. (Proyecciones (Antofagasta), 2019)
    The graphs whose energy is same as that of complete graphs are known as borderenergetic graphs. We propose a procedure for the construction of borderenergetic graphs and investigate three sequences of borderenergetic graphs.
  • Some new results on seidel equienergetic graphs 
    Vaidya, Samir K.; Popat, Kalpesh M. (Kyungpook Mathematical Journal, 2019)
    The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. Some variants of energy can also be found in the litera ture, in which the energy is defined for the Laplacian ...
  • Energy m-splitting and m-shadow graphs 
    Vaidya, Samir K.; Popat, Kalpesh M. (Far East Journal of Mathematical Sciences, 2017)
    We determine the energy of a graph obtained by means of graph operations on a given graph, and relate the energy of such a new graph with that of the given graph.
  • Some new results on energy of graphs 
    Vaidya, Samir K.; Popat, Kalpesh M. (MATCH Communications in Mathematical and in Computer Chemistry, 2017)
    The eigenvalue of a graph G is the eigenvalue of its adjacency matrix. The energy E (G) of G is the sum of absolute values of its eigenvalues. A natural question arises: How the energy of a given graph G can be related ...
  • On total domination in some path related graphs 
    Vaidya, S.K.; Parmar, A.D. (International Journal of Mathematics and Soft Computing, 2017)
    If G is a graph with vertex set V (G) then dominating set D⊆ V (G) is called total if every vertex of V (G) is adjacent to at least one vertex of D while it is called equitable if for every vertex u in V (G)− D there exists ...

Search DSpace


Advanced Search

Browse

My Account