DSpace Repository

Browsing 06. Department of Mathematics by Title

Browsing 06. Department of Mathematics by Title

Sort by: Order: Results:

  • 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 ...
  • Algorithm for finite family of variational inequality with fixed point of two non-expansive mappings 
    Swami, M.,; Rathee, S (Tamkang Journal of Mathematics, 2021)
    In the recent work, a new hybrid technique for computing the common solution of fixed point of a finite family of two non-expansive mapping and variational inequality problem for inverse strongly monotone mapping in a real ...
  • Antimagic Labeling in the Context of Switching of a Vertex 
    Vaidya, S.; Vyas, N. (Annals of Pure and Applied Mathematics, 2012)
    A graph with q edges is called antimagic if its edges can be labeled with 1, 2,…,q such that the sums of the labels of the edges incident to each vertex are distinct. Here we prove that the graphs obtained by switching ...
  • Antimagic Labeling of Some Path and Cycle Related Graphs 
    Vaidya, S.; Vyas, N. (Annals of Pure and Applied Mathematics, 2013)
    An edge labeling of a graph is a bijection from E(G) to the set {1,2,… , |E(G)|}. If for any two distinct vertices u and v, the sum of labels on the edges incident to u is different from the sum of labels on the edges ...
  • Application of Domination Theory in Operation Research: The Domination Model of Graphical Method for solving LPP with two variables 
    Bhatt, Tushar; Bhimani, G. (Journal of Science, KCG-portal of Journals, 2020-05)
    In this paper we can try to find a relationship between two different disciplines as theory of domination and operation research. In that concern we can try to make, a domination model for linear programming problem ...
  • Application of Graph Theory in Various Field of Applied Science & Engineering 
    Teraiya, O. M. (Journal of Emerging Technology and Innovative Research, 2019)
    In this paper, the research has been focus on application of graph theory in various field of Science & Engineering like Chemistry in Caterpillar Trees, Time Table Scheduling in Academics, Communication Network and Computer ...
  • Best Proximity Point for Generalized Rational \alpha_s Proximal Contraction 
    Duhan, Amit; Kumar, Manoj; Rathee, Savita; Swami, Monika (Journal of Harbin Engineering University, 2023)
    Best proximity point problem in S-M(S-metric) spaces is thought to be a generalization of a G- metric spaces. In this study, we provide proof a best proximity points theorem of αs−Proximal mapping admissible and its several ...
  • Characteristic polynomials of some algebraic graphs 
    Vaidya, S.K.; Jadeja, M.R. (Malaya Journal of Matematik, 2020)
    The zero divisor graph Γ(R) of a commutative ring R is a graph whose vertices are non-zero zero divisors of R and two vertices are adjacent if their product is zero. The characteristic polynomial of matrix M is defined ...
  • Composite Weiner Hopf Equation with Variational Inequality and Equilibrium Problem 
    Rathee, S; Swami, M. (Communications in Mathematics and Applications, 2021)
    In this paper, we introduce an iteration based on composite Weiner-Hopf equation technique to find the common solution of the set of solution of composite generalized variational inequality, set of equilibrium problem and ...
  • CONSTRUCTION OF L-BORDERENERGETIC GRAPHS 
    VAIDYA, SAMIR K; POPAT, KALPESH M (2021)
    If a graph G of order n has the Laplacian energy same as that of complete graph Kn then G is said to be L-borderenergeic graph. It is interesting and challenging as well to identify the graphs which are L-borderenergetic ...
  • CONVERGENCE RATE OF VARIOUS ITERATIONS WITH SM-ITERATION FOR CONTINUOUS FUNCTION 
    Rathee, S.,; Swami, M. (J. Math. Comput. Sci.,, 2020)
    In the present paper, we propose a new iteration process named as SM-iteration and compare its rate of convergence with the already existing iterations such as CR, S, Abbas, Thakur for different type of functions with the ...
  • Domination Model of Graphical Method for Solving LPP 
    Bhatt, Tushar; Bhimani, G. (International Journal of Research in Humanities & Soc. Sciences, 2020-04)
    In this paper we can try to find a relationship between two different disciplines as theory of domination and operation research. In that concern we can try to make, a domination model for linear programming problem ...
  • E-Cordial Labeling for Cartesian Product of Some Graphs 
    Vaidya, S.; Vyas, N. (Studies in Mathematical Sciences, CSCanada, 2011-11)
    We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2 and Pn × P2 are E-cordial for n even while Wn × P2 and K1,n × P2 are E-cordial for n odd.
  • E-Cordial Labeling in the Context of Switching of a Vertex 
    Vaidya, S.; Vyas, N. (International Journal of Advanced Computer and Mathematical Sciences, 2012)
    Let G=(V(G),E(G)) be a graph and f E G : ( ) {0,1} → be a binary edge labeling. Define * f V G : ( ) {0,1} → by * ( ) ( ) ( )( 2) uv E G f v f uv mod ∈ = ∑ . The function f is called E-cordial labeling of G if | ...
  • E-Cordial Labeling of Some Mirror Graphs 
    Vaidya, S.; Vyas, N. (International Journal of Contemporary Advanced Mathematics (IJCM), 2011)
    Let G be a bipartite graph with a partite sets V1 and V2 and G′ be the copy of G with corresponding partite sets V1 ′ and V2 ′ . The mirror graph M(G) of G is obtained from G and G′ by joining each vertex of V1 ...
  • Edge domination number of Jump Graph : A comparative Study 
    Bhatt, Tushar; Bhimani, G. (Journal of Emerging Technologies and Innovative Research (JETIR), 2019-06)
    In this paper we are trying to find that the domination number of any graph is obtain by using familiar method as vertex domination techniques and edge domination techniques but from the both who one is faster than ...
  • 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.
  • 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 ...
  • Even Mean Labeling for Path and Bistar related Graphs 
    Vaidya, S.; Vyas, N. (International Journal of Graph Theory(IJOGT), 2013-08)
    An even mean labeling is a variant of mean labeling. Here we investigate even mean labeling for path and bistar related graphs.
  • 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 ...

Search DSpace


Advanced Search

Browse

My Account