Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Hosamani, S. M."'
The eccentric-connectivity index of a graph G is the sum of the products of the eccentricity and the degree of each vertex in G. In this paper, we define four new invariants related to the eccentric-connectivity index and obtain upper bounds for tota
Externí odkaz:
http://arxiv.org/abs/2008.10194
Graph energy and Domination in graphs are most studied areas of graph theory. In this paper we made an attempt to connect these two areas of graph theory by introducing c-dominating energy of a graph $G$. First, we show the chemical applications of c
Externí odkaz:
http://arxiv.org/abs/1811.06269
Publikováno v:
Applied Mathematics and Nonlinear Sciences, Vol 4, Iss 2, Pp 503-512 (2019)
Graph energy and domination in graphs are most studied areas of graph theory. In this paper we try to connect these two areas of graph theory by introducing c-dominating energy of a graph G. First, we show the chemical applications of c-dominating en
Externí odkaz:
https://doaj.org/article/0015b458d7e14ec5afedc8a534b1d5e7
Publikováno v:
TWMS Journal of Applied and Engineering Mathematics, Vol 6, Iss 2, Pp 324-332 (2016)
Volume: 6, Issue: 2 324-332
TWMS Journal of Applied and Engineering Mathematics
Volume: 6, Issue: 2 324-332
TWMS Journal of Applied and Engineering Mathematics
The derived graph [G]y of a graph G is the graph having the same vertex set as G, with two vertices of [G]y being adjacent if and only if their distance in G is two. Topological indices are valuable in the study of QSAR/QSPR. There are numerous appli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::af7a5e4200a83c2cfbb263f322ca0728
http://jaem.isikun.edu.tr/web/index.php/archive/92-vol6no2/262-on-certain-topological-indices-of-the-derived-graphs-of-subdivision-graphs
http://jaem.isikun.edu.tr/web/index.php/archive/92-vol6no2/262-on-certain-topological-indices-of-the-derived-graphs-of-subdivision-graphs
Autor:
Basavanagoud, B.1 b.basavanagoud@gmail.com, Hosamani, S. M.1
Publikováno v:
Journal of Scientific Research. 2011, Vol. 3 Issue 3, p547-555. 9p.
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.
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:
Journal of Information & Optimization Sciences; May 2017, Vol. 38 Issue: 3-4 p417-422, 6p