02. Faculty of Science: Recent submissions

  • Image Set Quality Optimization for Handwritten Gujarati Character and Its Modifier Recognition 
    Priyank D. Doshi, Pratik A. Vanjara (2022)
    The problem of recognizing handwritten Gujarati characters has been tried by many researchers but still it requires enough work from vowel recognition up to its online application. The problem becomes even more complex if ...
  • Recommender System: Techniques, Comparison & Solutions 
    Divyesh Gohel, Dr. Pratik Vanjara (2022)
    There are several benefits of e-commerce websites that include cost effectiveness, convenience, flexibility, fast delivery, increase in income, etc. With these benefits, there is crucial role of e-commerce websites in ...
  • Characteristic polynomials of some algebraic 
    Vaidya, S. K.; Jadeja, M. R. (Malaya Journal of Matematik, 2020)
    The zero divisor graph of a commutative ring is a graph whose vertices are non-zero zero divisors of and two vertices are adjacent if their product is zero. The characteristic polynomial of matrix is defined as and roots ...
  • About m-domination number of graphs 
    Thakkar, D. K.; Jamvecha, P. (Malaya Journal of Matematik, 2019)
    In this paper, we have defined the concept of m-dominating set in graphs. In order to define this concept we have used the notion of m-adjacent vertices. We have also defined the concepts of minimal m-dominating set, minimum ...
  • A Comparative study of Data Mining Techniques for Agriculture Crop Price Prediction 
    Hirapara, Jignesh; Vanjara, Dr.Pratik (2022)
    Agriculture crop prices forecasting is a very interesting and high challenging process as it is fully dependent on upcoming production in entire country. Recently most available application is designed for price analysis ...
  • On m-independence in Graphs 
    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 ...
  • On ve-quasi and secured ve-quasi independent sets of a graph 
    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 ...
  • On total domination and total equitable domination in graphs 
    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 ...
  • Some More Results on Total Equitable Bondage Number of A Graph 
    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. ...
  • Few Results on Paired Domination Number of Some Graphs 
    Isaac, Rakhimol; Pandya, Parashree (Solovyov Studies ISPU, 2023)
    The paired dominating set D of graph G is the subset of vertex set of graph G such that the subset D is dominating set and the subgraph induced by D contains perfect Matching. The paired domination number is the minimum ...
  • INTERNATIONAL JOURNAL OF MATHEMATICAL COMBINATORICS EDITED 
    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 ...
  • Congruent Domination Number of Graphs Obtained by Means of Some Graph Operation 
    Jadeja, M. R.; Vadhel, H. D.; Parmar, A. D. (Journal of Applied Science and Computations, 2023-08)
  • SOME NEW RESULTS ON CHROMATIC TRANSVERSAL DOMINATION IN GRAPHS 
    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 ...
  • On chromatic transversal domination in graphs 
    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 ...
  • Invitro Study of Antagonistic Activity, Extraction and Optimization of Amylase Enzyme from Trichoderma Harzianum Against Selected Soil- Borne Fungal Isolates 
    Parmar, Amisha; Bhattacharya, Chitra; Kumar, Ravi Ranjan; Das, Mousumi; Doshi, Parin (Science and Technology Journal, 2022)
    Trichoderma harzianum has been well known as a potent biocontrol agent against several plant pathogenic fungi. But information with regard to dual role of Trichoderma as biocontrol and plant growth promoting agent is less ...
  • Risk Management Techniques in Banking Sector Using Data Mining 
    Ramani, Jaydeep R.,; Zalavadia, Jayesh N. (GIS Science Journal, 2020)
    There is a growing power of data mining in business applications, with several solutions already applied and many more being discovered. Since the worldwide financial crisis, risk management in banks has increased more ...
  • Performance Evaluation of RDBMS with Several NoSQL Databases in aspect of Medical Images 
    Parekh, Rupal; Patel, Achyut C. (Journal of Information and Computational Science, 2020)
    The use of digital medical imaging systems has greatly increased in healthcare institutions and they are currently valuable tools supporting medical decision and treatment procedures. NoSQL databases have been replacing ...
  • Open Packing Number of Some Path Related Graphs 
    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. ...
  • Total Equitable Bondage Number of a Graph 
    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 ...
  • Novel method in detecting outliers in medical database 
    Kavathiya, Hiren R.; Bhimani, G. C. (GIS Science Journal, 2020)
    In this paper, we used two models of outlier detection techniques in which the first model talks about Application of Data Mining Techniques for Outlier Mining in Medical Databases and the second model throws light on ...

Search DSpace


Advanced Search

Browse

My Account