Zobrazeno 1 - 10
of 25
pro vyhledávání: '"A. Berin Greeni"'
Autor:
S. Gajavalli, A. Berin Greeni
Publikováno v:
AIMS Mathematics, Vol 9, Iss 8, Pp 20367-20389 (2024)
The strong geodetic number of a graph and its edge counterpart are recent variations of the pioneering geodetic number problem. Covering every vertex and edge of $ G $, respectively, using a minimum number of vertices and the geodesics connecting the
Externí odkaz:
https://doaj.org/article/2dc6791a13ff4a08a53ef9fb76b50af1
Publikováno v:
Frontiers in Chemistry, Vol 12 (2024)
Topological descriptors are widely utilized as graph theoretical measures for evaluating the physicochemical properties of organic frameworks by examining their molecular structures. Our current research validates the usage of topological descriptors
Externí odkaz:
https://doaj.org/article/2b022fc1cb674cf9bddd6459e907cadc
Autor:
Micheal Arockiaraj, Francis Joseph H. Campena, A. Berin Greeni, Muhammad Usman Ghani, S. Gajavalli, Fairouz Tchier, Ahmad Zubair Jan
Publikováno v:
Heliyon, Vol 10, Iss 2, Pp e23981- (2024)
Tuberculosis (TB) is one of the most contagious diseases that has a greater mortality rate than HIV/AIDS and the cases of TB are feared to rise as a repercussion of the COVID-19 pandemic. The pharmaceutical industry is constantly looking for ways to
Externí odkaz:
https://doaj.org/article/eb3e811227424cf197ce8c9171461d33
Autor:
Arockiaraj, Micheal, Campena, Francis Joseph H., Berin Greeni, A., Ghani, Muhammad Usman, Gajavalli, S., Tchier, Fairouz, Jan, Ahmad Zubair
Publikováno v:
In Heliyon 30 January 2024 10(2)
Autor:
Gajavalli, S.1 (AUTHOR), Berin Greeni, A.1 (AUTHOR) beringreeni@gmail.com
Publikováno v:
Journal of Interconnection Networks. Sep2024, p1. 24p.
Autor:
Berin Greeni, A.1 (AUTHOR), Sundara Rajan, R.2 (AUTHOR) vprsundar@gmail.com, Immanuel, Paul1 (AUTHOR)
Publikováno v:
International Journal of Foundations of Computer Science. Jun2024, Vol. 35 Issue 4, p409-434. 26p.
Publikováno v:
International Journal of Foundations of Computer Science. :1-26
The technique used in studying the computational capabilities of interconnection networks and task distribution is graph embedding. Based on the recursively constructed graphs, the hypercube network is popular for its structure. Many variants of hype
Autor:
S. Gajavalli, A. Berin Greeni
Publikováno v:
Journal of Advanced Computational Intelligence and Intelligent Informatics. 27:119-123
The convexity induced by the geodesics in a graph G is called the geodesic convexity of G. Mycielski graphs preserve the property of being triangle-free and many parameters such as power domination number, coloring number, determining number and rece
Autor:
Vinitha Navis Varuvel, A Berin Greeni
Publikováno v:
Journal of Advanced Computational Intelligence and Intelligent Informatics. 27:101-104
A graph G with acyclic coloring has no two adjacent vertices with the same color and no bichromatic cycle. Also, the coloring results in a forest when any two-color classes are combined. The concept of acyclic coloring plays a pivotal role in the com
Autor:
Abul Kalaam, A. R., Berin Greeni, A.
Publikováno v:
International Journal of Quantum Chemistry; 1/5/2024, Vol. 124 Issue 1, p1-18, 18p