DSpace Repository

Browsing by Title

Browsing by Title

Sort by: Order: Results:

  • On kasaj-b-open sets and kasaj-regular-open sets in kasaj topological spaces 
    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. ...
  • ON LOWER BOUND TREES FOR THE RADIO NUMBER 
    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 ...
  • 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 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 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 SOLVING VARIATIONAL INEQUALITY FOR SM-ITERATION 
    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. ...
  • On total domination and total equitable domination in graphs 
    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 ...
  • 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 ...
  • On ve-quasi and secured ve-quasi independent sets of a graph 
    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 ...
  • Online Book Store 
    Rathod, Sahil; Hirpara, Vrushank (2023-04-05)
  • Online Examination System 
    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.
  • Online Grocery Shopping 
    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 ...
  • Online Grocery Website 
    Sureja, Deven S.; Patel, Anand R. (2023)
    This Report describes all the requirements for the project. The purpose of this research is to provide a virtual image for the combination of both structured and unstructured information of my project “Resort Management”. ...
  • Online Hall Booking System 
    Kukadiya, Arsh S.; Ghevariya, Jaydeep N. (2023-04-05)
    It is the Major-project for Auditorium booking system .Our idea involves creating a web app which can be used to book auditorium / hall in advance. The user can simply log in and select the hall. He/She wants to book a ...
  • Online Hall Booking System 
    kakadiya, Jay; kanpariya, Brijesh (2022)
    It is the mini-project for Auditorium booking system .Our idea involves creating a web app which can be used to book auditorium / hall in advance. The user can simply log in and select the hall. He/She wants to book a ...
  • Online QUIZ 
    Banugariya, jeel; Bhalodiya, janvi (2022)
    in this system there are mcq type question are provided to the candidate and there are four option are given. candidate can select one option and the result will be displayed to the candidate at the end of the exam. in ...
  • Online Security & Privacy : diagram and fundamental research 
    Bharadia, Jaydeep P.; Zalavadia, Jayesh N. (juni khayat, 2020)
    Throughout the most recent decade utilizing the Internet for web based shopping, data perusing and looking just as for online correspondence has become some portion of regular daily existence. In spite of the fact that the ...
  • Open packing number of some path related graphs 
    Vaidya, S.K.; Parmar, A.D. (Journal of Applied Science and Computations, 2019-05)
    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 ...
  • Open Packing Number of Triangular Snakes 
    Vaidya, S.K.; Parmar, A.D. (The International J. Mathematical Combinatorics, 2019)
    A set S ⊆ V (G) of vertices in a graph G is called a packing of G if the closed neighborhood of the vertices of S are pairwise disjoint in G. A subset S of V (G) is called an open packing of G if the open neighborhood ...
  • Operationalizing the antecedents and outcomes of union participation in the Indian context 
    Singh, Rupali; Singh, Trupti; Chawla, Ginni (Journal of Indian Business Research, 2019)
    Purpose – Unions and organizations interests are often seen to be in competition. However, union-voice hypothesis suggests that unions can provide a distinctive mechanism to lower organizational costs by reducing exit ...