DSpace Repository

Browsing by Title

Browsing by Title

Sort by: Order: Results:

  • Mashru, R.; Parmar, D.; Banerjee, Debashis (IJBPAS, 2023-10-15)
    Background: Raising awareness about the symptoms and undergoing cancer screening programs can aid in the early detection of cervical cancer. Numerous developed countries have observed a decrease of 50-70% in the annual ...
  • Patel, Jay; Kanchava, Yuvrajsinh (23rd ISTE State Annual Convention And National Conference on “Role of innovation & Human values in Engineering & Technology”, 2024-03-21)
    It is an effort in the direction of energy efficient alternative for home lighting system. It proposes the off grid decentralized solar power system. An Existing setup of electricity generation is centralized. It generates ...
  • Radadiya, Rahul A. (2023-04-12)
    Food stuffs and Animal feeds are the great source of nutrition for microbes.It is important to check quality of food stuffs, animal feeds and water before consumption Because It has been provide opportunity to growth of ...
  • 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 χ(G) ...
  • Thakkar, D.K.; Jamvecha, N.P. (International Journal of Mathematical Archive, 2017-06)
    In this paper we further study the concept of edge-edge domination in graphs. We observe that the edge-edge domination number of a graph may increase or decrease or remains same when a edge is removed from a graph. We ...
  • VAIDYA, SAMIR K; POPAT, KALPESH M (2018-06-15)
    The eigenvalue of a graph G is the eigenvalue of its adjacency matrix and the energy E(G) is the sum of absolute values of eigenvalues of graph G. Two non-isomorphic graphs G1 and G2 of the same order are said to be ...
  • Rachchh, Kashyap G.; Soneji, Asfak A.; Ghanchi, Sajeed I. (Journal of Emerging Technologies and Innovative Research, 2020-12)
    We introduced Kasaj topological spaces which is a partial extension of Micro topological space which is introduced by S. Chandrasekar. We also analyzed basic properties of some weak open sets in Kasaj topological spaces. ...
  • Rachchh, Kashyap G.; Ghanchi, Sajeed I. (Malaya Journal of Matematik, 2020-10)
    In year 2013, L. Thivagar et al. introduced nano topological space and he analysed some properties of weak open sets. In this paper we shall introduce Kasaj-topological space. We shall introduce some new classes of weak ...
  • Rachchh, Kashyap G.; Soneji, Asfak A.; Ghanchi, Sajeed I. (Journal of Emerging Technologies and Innovative Research, 2020-12)
    Recently, We defined Kasaj-topological space and weak open sets namely Kasaj-pre-open sets, Kasaj-semi-open sets, Kasaj-alpha-open sets, Kasaj-beta-open sets in Kasaj topological spaces and analyzed their basic properties. ...
  • Vasoya, Payal (South East Asian Journal of Mathematics and Mathematical Sciences, 2022)
    A radio labeling of a graph $G$ is a function $f$ from the set of vertices $V(G)$ to the set of non-negative integers such that $|f(u)-f(v)|\geq \diam(G) + 1 - d(u,v)$ for every pair of distinct vertices $u,v$ of $G$. The ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Rathee, S.; Swami, M. (J. Math. Comput. Sci, 2021)
    The fundamental motivation behind this paper is to solve variational inequality for SM-iterative method under some gentle conditions. We focus on calculating the common results of variational inequality and of SM-iteration. ...
  • Vaidya, S.K.; Parmar, A.D. (Malaya Journal of Matematik, 2018)
    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. (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 ...
  • Thakkar, D. K.; Jamvecha, Neha 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 ...
  • Rathod, Sahil; Hirpara, Vrushank (2023-04-05)
  • Bhimani, Shreyansh; Joshi, Vatsal (2022)
    Online Examination System is an Android Mobile Application. It fulfils the requirements of the institutes to conduct the exams online. The purpose is to provide a system that saves the effort and time of institution.
  • Suhagiya, Het; Shah, Naitik; Zala, Yashrajsinh (2023-04-05)
    The “Online Grocery Shopping System” has been developed to override the problems prevailing in the practicing manual system. This software is supported to eliminate and in some cases reduce the hardships faced by this ...