Jonnalagadda Venkateswara Rao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Jonnalagadda Venkateswara Rao has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Nageswara Rao Thota
Department of Engineering Mathematics, College of Engineering, Koneru Lakshmaiah Education Foundation, Vaddeswaram, Andhra Pradesh, 522302, India
3 shared publications E. S. Rama Ravi Kumar
Department of Mathematics, V.R. Siddhartha Engineering College, Vijayawada, Andhra Pradesh, India
2 shared publications- Ch. Baby Rani
Department of Mathematics, V.R. Siddhartha Engineering College, Vijayawada, Andhra Pradesh, India
1 shared publication - D. Kalyani
D.S. Government Degree College (W-Autonomous), Ongole, India
1 shared publication - E Sri Rama Ravi Kumar
V. R. Siddhartha Engineering College-Deemed to Be University, Vijayawada, India
1 shared publication J. Siva Ram Prasad
Department of Mathematics, V.R. Siddhartha Engineering College, Vijayawada, Andhra Pradesh, India
1 shared publication
Latest Publications
- 15 December 2024
- Published by Springer Nature in Wireless Personal Communications
- Vol. 139 (3) , 1423-1436
Characterizations of Lattice Ordered Semigroups in Pre-A*_Algebras-A Math Technique in Communication Technology
- 15 December 2024
- Published by Springer Nature in Wireless Personal Communications
- Vol. 139 (3) , 1423-1436
Characterizations of Lattice Ordered Semigroups in Pre-A*_Algebras-A Math Technique in Communication Technology
- Open Access
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2707 (1)
Simulating of harmonization 𝕜ernel ideal in nearby fuzzy assumed complemented semilattice
Respective foremost out-turn concerning compatibility 𝕂ernels of Fuzy Assumed complemented semi lattice are illustrated in this article, also sustains in Nearby Fuzy Assumed complemented semi lattice. It provides an obligatory and abundant conditions for * harmonization of Nearby Fuzy Assumed complemented semi lattice (Q) and aforesaid, a subset of Q, which assure certain conditions is 𝕂ernel of some compatibility on Q. It allows the conviction of 𝕂ernel ℐde𝔞l in Q, and establishes an obligatory and abundant condition for an ℐde𝔞l to be a 𝕂ernel ℐde𝔞l in Q.
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2707 (1)
Open AccessSimulating of harmonization 𝕜ernel ideal in nearby fuzzy assumed complemented semilattice
Respective foremost out-turn concerning compatibility 𝕂ernels of Fuzy Assumed complemented semi lattice are illustrated in this article, also sustains in Nearby Fuzy Assumed complemented semi lattice. It provides an obligatory and abundant conditions for * harmonization of Nearby Fuzy Assumed complemented semi lattice (Q) and aforesaid, a subset of Q, which assure certain conditions is 𝕂ernel of some compatibility on Q. It allows the conviction of 𝕂ernel ℐde𝔞l in Q, and establishes an obligatory and abundant condition for an ℐde𝔞l to be a 𝕂ernel ℐde𝔞l in Q.
- Open Access
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2707 (1)
Dominating set of fuzzy and anti-fuzzy graphs using algorithms
In this article, we discuss a dominating set D in a fuzzy graph F and anti fuzzy graph FA. The boundaries on the domination number of an anti-fuzzy graph are obtained. A fuzzy matrix is defined on an anti-fuzzy graph. Some properties of the adjacency fuzzy matrix are discussed. Using a strong adjacency matrix, an algorithm is formulated to find a minimal dominating set of an anti fuzzy graph FA and by using a strong neighborhood fuzzy matrix, an algorithm is defined to predict the total dominating set for FA.
- 1 January 2023
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2707 (1)
Open AccessDominating set of fuzzy and anti-fuzzy graphs using algorithms
In this article, we discuss a dominating set D in a fuzzy graph F and anti fuzzy graph FA. The boundaries on the domination number of an anti-fuzzy graph are obtained. A fuzzy matrix is defined on an anti-fuzzy graph. Some properties of the adjacency fuzzy matrix are discussed. Using a strong adjacency matrix, an algorithm is formulated to find a minimal dominating set of an anti fuzzy graph FA and by using a strong neighborhood fuzzy matrix, an algorithm is defined to predict the total dominating set for FA.