Zobrazeno 1 - 10
of 425
pro vyhledávání: '"K Palani"'
Autor:
M.Karthigai Jothi, K Palani
Publikováno v:
Ratio Mathematica, Vol 48, Iss 0 (2023)
This article investigates the notion of N-δI-closed sets and its properties in ideal nano topological space using the closure operator NclδI(S)={xÎՍ/ Nint(Ncl*(W))∩ S ≠ ∅, for each WÎWN(x)}. We establish NclδI(S) is the intersection of al
Externí odkaz:
https://doaj.org/article/473bcde1beec48279b7d26484d1e70d5
Publikováno v:
Ratio Mathematica, Vol 44, Iss 0, Pp 349-353 (2022)
Let G be a graph and let f be a function that assigns to each vertex a set of colors chosen from the set {1, 2…, k} that is f: V(G) P [1,2,…,k]. If for each vertex v V(G) such that f(v) = .we have then f is called the k – Rainbow Dominating Fun
Externí odkaz:
https://doaj.org/article/4672dda8baea454c9d5ece694c0cfcb2
Publikováno v:
Ratio Mathematica, Vol 44, Iss 0, Pp 363-370 (2022)
A Digraph D consists of two finite sets ), where denotes the vertex set and denotes the arc set. For vertices if there exists a directed path from to then is said to be reachable from and vice versa. The Reachability matrix of D is the matrix , where
Externí odkaz:
https://doaj.org/article/59acbfac3af94389b3d1731cfc2d3dad
Publikováno v:
Ratio Mathematica, Vol 44, Iss 0, Pp 340-348 (2022)
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a product signed dominating function, if for every vertex where . The weight of , denoted by , is the sum of the function values of all the vertices in . . Th
Externí odkaz:
https://doaj.org/article/8055fa4e181d473db799d46bcba63c29
Autor:
K Palani, M Karthigai Jothi
Publikováno v:
Ratio Mathematica, Vol 44, Iss 0, Pp 354-362 (2022)
In this paper we introduce the notion of semi generalized dI*-closed sets or gsdI*-closed sets using semi open sets and investigate its basic properties and characterizations in an ideal topological space. This class of sets is properly lies between
Externí odkaz:
https://doaj.org/article/8d3deb6985b2480bb46ad9fa7133e1e8
Autor:
K Palani, S S Sabarina Subi
Publikováno v:
Ratio Mathematica, Vol 45, Iss 0 (2023)
Let\ D be a strong digraph and let \vec{d}(u,\ v) denote the distance between any two vertices in D. A radio mean labeling is a one-to-one mapping f from V(D) to\ N satisfying the condition \vec{d}(u,\ v) +\left\lceil\frac{f\left(u\right)+f(v)}{2}\ri
Externí odkaz:
https://doaj.org/article/2e087ea29dcf483284e98696312d4910
Autor:
K Palani, A Shunmugapriya
Publikováno v:
Ratio Mathematica, Vol 45, Iss 0 (2023)
Gaussian integers are complex numbers of the form \gamma=x+iy where x and y are integers and i^2=-1. The set of Gaussian integers is usually denoted by \mathbb{Z}[i]. A Gaussian integer \gamma=a+ib\in\mathbb{Z}[i] is prime if and only if either \gamm
Externí odkaz:
https://doaj.org/article/4f9f24801e2546eebc902152a62f321a
Autor:
K Palani, A Shunmugapriya
Publikováno v:
Ratio Mathematica, Vol 45, Iss 0 (2023)
K. Palani et al. defined the concept of near mean labeling in digraphs. Let D=(V,A) be a digraph where Vthe vertex is set and A is the arc set. Let f:V\rightarrow{0,\ 1,\ 2,\ \ldots,q} be a 1-1 map. Define f^\ast:A\rightarrow{1,\ 2,\ \ldots,q} byf^\a
Externí odkaz:
https://doaj.org/article/552d10a9e6494c6aa7d0df23933f79ef
Publikováno v:
In Physica B: Condensed Matter 1 February 2024 674
Autor:
Thanaraj, K. Palani, Parvathavarthini, B., Tanik, U. John, Rajinikanth, V., Kadry, Seifedine, Kamalanand, K.
This paper evaluates the approach of imaging timeseries data such as EEG in the diagnosis of epilepsy through Deep Neural Network (DNN). EEG signal is transformed into an RGB image using Gramian Angular Summation Field (GASF). Many such EEG epochs ar
Externí odkaz:
http://arxiv.org/abs/2003.04534
