Zobrazeno 1 - 10
of 234
pro vyhledávání: '"B. Basavanagoud"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 309-329 (2021)
A communication network can be considered to be highly vulnerable to disruption if the failure of few members (nodes or links) can result in no member’s being able to communicate with very many others. These communication networks can be modeled th
Externí odkaz:
https://doaj.org/article/4a48d9c6061440fb94e9e76e881fa865
Publikováno v:
Transactions on Combinatorics, Vol 10, Iss 3, Pp 171-185 (2021)
A communication network can be considered to be highly vulnerable to disruption if the failure of few members (nodes or links) can result in no members being able to communicate with very many others. These communication networks can be modeled
Externí odkaz:
https://doaj.org/article/85454cd6e30d4463921998bb213a2c0a
Autor:
B. Basavanagoud, Shruti Policepatil
Publikováno v:
Ratio Mathematica, Vol 40, Iss 1, Pp 27-46 (2021)
The values of vulnerability helps the network designers to construct such a communication network which remains stable after some of its nodes or communication links are damaged. The transformation graphs considered in this paper are taken as model o
Externí odkaz:
https://doaj.org/article/f8f04455f07d4a0d8a95072d35fbfbba
Publikováno v:
Saudi Pharmaceutical Journal, Vol 25, Iss 4, Pp 580-586 (2017)
In theoretical medicine, topological indices are defined to test the medicine and pharmacy characteristics, such as melting point, boiling point, toxicity and other biological activities. As basic molecular structures, hexagonal jagged-rectangle and
Externí odkaz:
https://doaj.org/article/4dfa6459b82e45988611119ad9e00fd6
Autor:
Mahammadsadiq Sayyed, B. Basavanagoud
Publikováno v:
South East Asian J. of Mathematics and Mathematical Sciences. 18:135-148
For molecular graph G, the first multiplicative Zagreb index is defined as the product of squares of degree of all vertices of graph and the second multiplicative Zagreb index is defined as Q 2 (G) = Q u∈V (G) dG(u) dG(u) . In this paper, we obtain
Autor:
B. Basavanagoud, Mahammadsadiq Sayyed
Publikováno v:
Malaya Journal of Matematik. 9:775-781
Autor:
B Basavanagoud, Sunilkumar M Hosamani
Publikováno v:
Transactions on Combinatorics, Vol 1, Iss 2, Pp 17-25 (2012)
A dominating set $D subseteq V$ of a graph $G = (V,E)$ is said to be a connected cototal dominating set if $langle D rangle$ is connected and $langle V-D rangle neq phi$, contains no isolated vertices. A connected cototal dominating set is said to be
Externí odkaz:
https://doaj.org/article/7e8d2c34d6ec4f6ab556a212758ffd9f
Autor:
C.S. Gali, B. Basavanagoud
Publikováno v:
International Journal of Scientific Research in Mathematical and Statistical Sciences. 5:33-40
Autor:
B. Basavanagoud, Chetana S. Gali
Publikováno v:
Journal of Computer and Mathematical Sciences. 9:799-828
Autor:
B. Basavanagoud, Chitra E
Publikováno v:
Journal of Computer and Mathematical Sciences. 9:550-561