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 ...
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 ...
Bhatt, Tushhar(Educational Administration: Theory and Practice, 2024)
et 𝐺=(𝑉(𝐺),𝐸(𝐺))be a connected graph. Let 𝑀⊆𝑉(𝐺)be a minimum perfect dominating set and 𝑇⊆𝑉(𝐺)\𝑀is said to be sub-restrained perfect dominating setof Gif every 𝑣∈𝑉(𝐺)∖𝑇such that|𝑁(𝑣)∩𝑇|=1. The ...
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 ...
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 ...
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 ...
Iassc, Rakhimol; Bhatt, Krupali(Journal of Computational Mathematica, 2023)
For a graph G = (V, E), a set S ⊆ V is a dominating set if every vertex in V − S is adjacent to at least one vertex in S. The domination number γ(G) of G equals the minimum cardinality of a dominating set in G. A dominating ...
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 ...
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 ...
Rathee, Savita; Swami, Monika; Kumari, Neelam(TAMKANG JOURNAL OF MATHEMATICS, 2024)
In this study, PPF dependent fixed point theorems are proved for a nonlinear operator, where the domain space C[[a, b], E] is distinct from the range space, E, which is a Strong Partial b-metric space (SPbMS). We obtain ...
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, 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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...