Zobrazeno 1 - 10
of 19
pro vyhledávání: '"S. V. Divya"'
Autor:
K. U. Abinesh Kamal, S. V. Divya
Publikováno v:
Automatika, Vol 65, Iss 2, Pp 401-409 (2024)
Organizations have to establish strong security operations to protect their digital assets since cyberattacks are becoming more prevalent and sophisticated. Integrating threat intelligence into security operations is a fundamental strategy for enhanc
Externí odkaz:
https://doaj.org/article/97dc9cce251347ce99cfbb3ca36ecfaf
This manuscript investigates wormhole solutions within the framework of extended symmetric teleparallel gravity, incorporating non-commutative geometry, and conformal symmetries. To achieve this, we examine the linear wormhole model with anisotropic
Externí odkaz:
http://arxiv.org/abs/2312.09640
Publikováno v:
Chinese Journal of Physics (2023)
In this study, we explore the new wormhole solutions in the framework of new modified $f(R,L_m)$ gravity. To obtain a characteristic wormhole solution, we use anisotropic matter distribution and a specific form of energy density. As second adopt the
Externí odkaz:
http://arxiv.org/abs/2305.01469
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Communications in Theoretical Physics; Feb2024, Vol. 76 Issue 2, p1-14, 14p
Autor:
W. G. Flindon, S. V. Divya
Publikováno v:
AIP Conference Proceedings.
Autor:
L., DILEEP, S. V., DIVYA RASHMI
Publikováno v:
TWMS Journal of Applied & Engineering Mathematics; 2023, Vol. 13 Issue 1, p46-52, 7p
Publikováno v:
Malaysian Journal of Computer Science. 32:163-185
With the hasty growth of the Internet technologies and the need for increased computational methods, cloud computing has become a new paradigm in the business and IT endeavors. This technology facilitates the enterprises to move their confidential da
Publikováno v:
Journal of Computational and Theoretical Nanoscience. 15:111-120
Publikováno v:
Electronic Notes in Discrete Mathematics. 53:297-306
A subset S of V is a dominating set of a graph G = ( V , E ) if every vertex in V \ S is adjacent to a vertex in S. A dominating set S is called a secure dominating set if for each v ∈ V \ S there exists u ∈ S such that v is adjacent to u and S 1