Zobrazeno 1 - 10 of 61 pro vyhledávání: '"B Basavanagoud"'
1
Akademický článek
Integrity of total transformation graphs
Autor: B Basavanagoud, Praveen Jakkannavar, Shruti Policepatil
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
Zobrazit plný text záznamu
2
Akademický článek
Connected cototal domination number of a graph
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
Zobrazit plný text záznamu
3
MULTIPLICATIVE ZAGREB INDICES OF FOUR NEW F-SUMS OF GRAPHS
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
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ccd813c1359209089a8b5b830c5aeeed
https://doi.org/10.56827/seajmms.2022.1802.13
Zobrazit plný text záznamu
4
Integrity of Generalized Transformation Graphs
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://explore.openaire.eu/search/publication?articleId=doajarticles::5bab03a8103b3fe7d30936d5cac8e15c
http://eiris.it/ojs/index.php/ratiomathematica/article/view/576
Zobrazit plný text záznamu
9
Basic properties of generalized xyz–Point-Line transformation graphs
Autor: B. Basavanagoud
Publikováno v: Journal of Information and Optimization Sciences. 39:561-580
Given a graph G with vertex set V(G) = V and edge set E(G) = E, let L(G) be the line graph and Ḡ the complement of G. Let G0 be the graph with V(G0) = V and with no edges, G1 the complete graph with the vertex set V, G+ = G and G– = Ḡ. Let S(G)
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::af3b2b038429ee3f8f45bebdb9f15772
https://doi.org/10.1080/02522667.2017.1395147
Zobrazit plný text záznamu
10
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.

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje