Zobrazeno 1 - 10
of 4 039
pro vyhledávání: '"S, Devi"'
Autor:
Rochit, L, N, Nithish Kumar, S, Devi Priya V, Sethuraman, Sibi Chakkaravarthy, Subramanian, Anitha
The ocean ecology is badly impacted by large-scale oil spills, plastic waste, and chemical pollution, which destroy ecosystems and endanger marine life. Acknowledging the detrimental effects of oil spills on ecosystems, our research aims to establish
Externí odkaz:
http://arxiv.org/abs/2409.01642
Recent increases in endpoint-based security events and threats compelled enterprise operations to switch to virtual desktop infrastructure and web-based applications. In addition to reducing potential hazards, this has guaranteed a consistent desktop
Externí odkaz:
http://arxiv.org/abs/2408.17045
Given a (proper) vertex coloring $f$ of a graph $G$, say $f\colon V(G)\to \mathbb{N}$, the difference edge labelling induced by $f$ is a function $h\colon E(G)\to \mathbb{N}$ defined as $h(uv)=|f(u)-f(v)|$ for every edge $uv$ of $G$. A graceful color
Externí odkaz:
http://arxiv.org/abs/2407.02179
Autor:
D., Laavanya, S., Devi Yamini
A graceful $l$-coloring of a graph $G$ is a proper vertex coloring with $l$ colors which induces a proper edge coloring with at most $l-1$ colors, where the color for an edge $ab$ is the absolute difference between the colors assigned to the vertices
Externí odkaz:
http://arxiv.org/abs/2406.20032
Autor:
D, Nivedha, S, Devi Yamini
An antimagic labeling of a graph $G$ is a one-to-one correspondence between the edge set $E(G)$ and $\lbrace 1,2,...,|E(G)|\rbrace$ in which the sum of the edge labels incident on the distinct vertices are distinct. Let $G$,$H_1$,$H_2$,...,$H_{m-1}$,
Externí odkaz:
http://arxiv.org/abs/2311.10335
Autor:
Nivedha, D., Yamini, S. Devi
An antimagic labeling of a graph $G$ is a $1-1$ correspondence between the edge set $E(G)$ and $\lbrace 1,2,...,|E(G)|\rbrace$ in which the sum of the labels of edges incident to the distinct vertices are different. The edge corona of any two graphs
Externí odkaz:
http://arxiv.org/abs/2211.16875
Autor:
Laavanya, D, Yamini, S Devi
A graceful k-coloring of a non-empty graph $G=(V,E)$ is a proper vertex coloring $f:V(G)\rightarrow\lbrace 1,2,...,k \rbrace$, $k\geq 2$, which induces a proper edge coloring $f^{*}:E(G)\rightarrow\lbrace 1, 2, . . . , k-1 \rbrace $ defined by $f^{*}
Externí odkaz:
http://arxiv.org/abs/2211.15904
Autor:
A.G. Kishore Gopal, K. Krithiga, K. S. Prasanna, C. Divya, R. Anoopraj, Surya Sankar, I. S. Sajitha, S. S. Devi
Publikováno v:
Journal of Veterinary and Animal Sciences, Vol 55, Iss 2, Pp 394-401 (2024)
Externí odkaz:
https://doaj.org/article/6b760f81e348480d91bcdf80417b5851
Autor:
S.P. Niranjan, S. Devi Latha
Publikováno v:
Baghdad Science Journal, Vol 21, Iss 8 (2024)
Customers are arriving at the system in bulk according to the Poisson process with rate λ1. The batch service process is split into two phases called first essential service (FES) and second essential service (SES) with minimum server capacity ′a
Externí odkaz:
https://doaj.org/article/108e3b02b4704580a63826dd60509915
Autor:
Nisna Niyas, I. S. Sajitha, K.S. Prasanna, S. S. Devi, Sudheesh S Nair, A.K. Anseena, S. Afsal
Publikováno v:
Journal of Veterinary and Animal Sciences, Vol 55, Iss 1, Pp 122-128 (2024)
Externí odkaz:
https://doaj.org/article/f1fb984c46ad4ddcb861326400847e04