DSpace Repository

Browsing 01. Journal Articles by Title

Browsing 01. Journal Articles by Title

Sort by: Order: Results:

  • Bhatt, Tushar; Bhimani, G. (Malaya Journal of Matematik, 2021)
    According to the research paper on Perfect Dominating Sets by Marilynn Livingston and Quentin F. Stout[1]they have been constructed the PDSs in families of graphs arising from the interconnected networks of parallel computers ...
  • Vaidya, S.; Vyas, N. (Malaya Journal of Matematic (MJM) - An International Journal of mathematical science with computer applications, 2014)
    The product cordial labeling is a variant of cordial labeling. Here we investigate product cordial labeling for alternate triangular snake and alternate quadrilateral snake graphs
  • Vaidya, S.; Vyas, N. (AMO - Advanced Modeling and Optimization, 2014)
    For the graph G = (V (G), E(G)), a function f : V (G) → {0, 1} is called a product cordial labeling of G if the induced edge labeling function defined by the product of end vertex labels be such that the edges with label ...
  • Vaidya, S.; Vyas, N. (Journal of Mathematics Research, 2011-08)
    For the graph G1 and G2 the tensor product is denoted by G1(Tp)G2 which is the graph with vertex set V(G1(Tp)G2) = V(G1) × V(G2) and edge set E(G1(Tp)G2) = {(u1, v1), (u2, v2)/u1u2 E(G1) and v1v2 E(G2)}. The graph Pm(Tp)Pn ...
  • Vaidya, S.K.; Ajani, P.D. (Journal of Computational Mathematica, 2017)
    A dominating set S ⊆ V (G)of a graph G is called restrained dominating set if every vertex in V (G) - S is adjacent to a vertex in S and to a vertex in V (G) - S. The restrained domination number of G, denoted by γ_r (G), ...
  • 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 ...
  • Bhatt, Tushar; Zalavadiya, Jayesh; Teraiya, Om (Journal of Emerging Technologies and Innovative Research (JETIR), 2018-12)
    Domination theory is a part of Graph theory is used for finding communities in networks, device for modeling, description of real world network systems such are : Transport, Water, Electricity, Internet and many more. ...
  • Swami, Monika (TAMKANG JOURNAL OF MATHEMATICS, 2024)
    In this article, we demonstrate some fixed point results that generalisesthe Banach contraction principle in a different way from the previously establishedliterature findings. We provide some fixed point findings ...
  • Vaidya, S.; vyas, N. (International Journal of Graph Theory(IJOGT), 2013-12)
    A function f: V(G) →{2,4, …, 2|E(G)|} is called an even mean labeling of graph G if it is injective and when each edge e=uv is labeled with average sum of f(u) and f(v) then the resulting edge labels are distinct. Here ...
  • Popat, Kalpesh M (2022-08-30)
    The eigenvalue of a graph G is the eigenvalue of its adjacency matrix and the energy E(G) of graph G is the sum of absolute values of its eigenvalues. Two non-isomorphic graphs G1 and G2 of the same order are said to be ...
  • Vaidya, S.K.; Parmar, A.D. (International Journal of Mathematical Sciences and Engineering Applications, 2019-06)
    A vertex dominating set D of V (G) is called a chromatic transversal dominating set of G if D intersects every color class of G. The minimum cardinality of D is called a chromatic transversal domination number of G. In ...
  • 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 ...
  • Vaidya, Samir K.; Popat, Kalpesh M. (MATCH Communications in Mathematical and in Computer Chemistry, 2017)
    The eigenvalue of a graph G is the eigenvalue of its adjacency matrix. The energy E (G) of G is the sum of absolute values of its eigenvalues. A natural question arises: How the energy of a given graph G can be related ...
  • Popat, Kalpesh; Shingala, Kunal (Journal of Mathematical Chemistry, 2023)
    The graph Gσ is obtained from graph G by attaching self loops on σ vertices. The energy E(Gσ) of the graph Gσ with order n and eigenvalues λ1, λ2, . . . , λn is defined as E(Gσ) = Xn i=1 λi −σ/n.It has been proved that ...
  • Vaidya, Samir K; Popat, Kalpesh M (2019-05-10)
    The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. Some variants of energy can also be found in the litera- ture, in which the energy is de_ned for the Laplacian ...
  • RATHEE, S.,; KUMARI, N; SWAMI, M. (Advances and Applications in Mathematical Sciences, 2023)
    In this article, we develop some PPF dependent fixed point results for nonself mapping in Metric spaces for Prešić-Hardy-Rogers contraction, which is generalization of Prešić type contraction, where the domain space abstract ...
  • Swami, Monika (Advances and Applications in Mathematical Sciences, 2023-04)
    In this article, we develop some PPF dependent fixed point results for nonself mapping in Metric spaces for Prešić-Hardy-Rogers contraction, which is generalization of Prešić type contraction, where the domain space abstract ...
  • Vaid, S.; Vyas, N. (International Journal of Mathematics and Scientific Computing, 2012)
    A binary vertex labeling f : E(G) → {0, 1} with induced labeling f ∗ : V (G) → {0, 1} defined by f ∗ P (v) = {f(uv) | uv ∈ E(G)}(mod 2) is called E-cordial labeling of a graph G if the number of vertices labeled 0 ...
  • Vaidya, Samir K; Popat, Kalpesh M (2019-12)
    The concept of graph energy is a frontier between two important branches of basic sciences: namely, Mathematics and Chemistry. The sum of absolute values of eigenvalues of adjacency matrix of graph is called the energy ...
  • Rathee, S.,; Swami, M. (Journal of the Indonesian Mathematical Society, 2021)
    The motivation behind this paper is to use hybrid method for searching a typical component of the set of fixed points of an infinite family of nonexpansive mappings and the set of monotone, Lipschtiz continuous variational ...

Search DSpace


Advanced Search

Browse

My Account