00. Faculty Publications: Recent submissions

  • BEST PROXIMITY POINTS FOR GF PROXIMAL CONTRACTION AND ITS APPLICATIONS TO VARIATIONAL INEQUALITY PROBLEM 
    Rathee, Savita; Mor, Prateek (International Review of Pure and Applied Mathematics, 2019)
    The main concept of this paper is to introduce the notion of GF and GF generalized proximal contraction and to establish the existence and uniqueness of best proximity point for nonself mapping satisfying these contractions ...
  • On Kasaj Generalized Closed Sets in Kasaj Topological Spaces 
    Rachchh, K. G.; Soneji, A. A; Ghanchi, S. I. (Journal of Emerging Technologies and Innovative Research, 2020)
    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. ...
  • On Kasaj-b-open Sets and Kasaj-regular-open Sets in Kasaj Topological Spaces 
    . Rachchh, Kashyap G; Ghanchi, Sajeed I.; Soneji, Asfak A. (Journal of Emerging Technologies and Innovative Research, 2020)
    Abstract : 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 ...
  • On Kasaj topological spaces 
    Kashyap, G.; Sajeed, I. (Malaya Journal of Matematik, 2020)
    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 ...
  • A Study on Vertex Eccentricity Labeled Energy of a Graph 
    Gusai, S. L.; Kaneria, V. J.; Jadeja, M. R. (Shri U.P. Arts, Smt. M.G. Panchal Science, 2024)
    Eccentricity, Vertex eccentricity labeled matrix, Vertex eccentricity labeled energy In this paper, we introduce the concept of vertex eccentricity labeled energy of a graph. We investigate the vertex eccentricity ...
  • TOTAL DOMINATING SETS AND TOTAL DOMINATION POLYNOMIAL OF WHEEL 
    Parmar, Anil D.; Manoharsinh; Jadeja, R. (Shri U.P. Arts, Smt. M.G. Panchal Science, 2023)
    For a graph with order then total domination polynomial where, is the number of total dominating sets of of cardinality . In this paper,I have obtained the total dominating sets and total domination polynomial of the ...
  • 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)
    Abstract A dominating set is said to be a congruent dominating set of a graph if . The minimum cardinality of a minimal congruent dominating set of is called the congruent domination number of which is denoted by . In ...
  • METRIC DIMENSION OF GRAPHS OBTAINED FROM COMMUTATIVE RING 
    VAIDYA, S; JADEJA, M (Advances and Applications in Mathematical Sciences, 2022)
    For a connected graph of order n, the metric basis of a G is a smallest set {} k v vv S,,, 2 =1 of vertices of G such that for vertex, G u∈ the ordered k-tuples of are all distinct.distances {()()()()} k vud vud vud ...
  • 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 ...
  • On m-independence in Graphs 
    Thakkar, D. K.; Jamvecha, Neha P. (International Journal of Scientific Research, 2019)
    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, 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 ...
  • On total domination and total equitable domination in graphs 
    Vaidya, S. K.; Parmar, A. D. (Malaya Journal of Matematik, 2018)
    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. ...
  • INTERNATIONAL JOURNAL OF MATHEMATICAL COMBINATORICS EDITED B 
    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 ...
  • 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 ...
  • Open Packing Number of Some Path Related Graphs 
    Vaidya, S. K.; Parmar, A. D. (JASC: Journal of Applied Science and Computations, 2018)
    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 ...
  • Restrained Edge Domination Number of Some Path Related Graphs 
    Vaidya, S. K; Ajani, P. D (JSR Publications, 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 ...
  • Equitable restrained domination number of some graphs 
    Vaidya, S. K.; jaAni, 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 ...

Search DSpace


Advanced Search

Browse

My Account