Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Mesfin Masre"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1 (2022)
The zeroth-order general Randić index of a graph G is defined as Ra(G)=∑v ∈ V(G)dGa(v), where a ∈ ℝ, V(G) is the vertex set of G and dG(v) is the degree of a vertex v in G. We obtain bounds on the zeroth-order general Randić index for trees
Externí odkaz:
https://doaj.org/article/bc86bedcf60a4960b370c2b1ad87e6fa
Autor:
Mesfin Masre, Tomáš Vetrík
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:2753-2772
For a connected graph G and $$a,b \in \mathbb {R}$$ , the general degree-eccentricity index is defined as $$\mathrm{DEI}_{a,b}(G) = \sum _{v \in V(G)} d_{G}^{a}(v) \mathrm{ecc}_{G}^{b}(v)$$ , where V(G) is the vertex set of G, $$d_{G} (v)$$ is the de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b59d3131a54b7583e12f2d4e924346a
https://doi.org/10.1007/s40840-021-01086-y
https://doi.org/10.1007/s40840-021-01086-y
Autor:
Mesfin Masre, Tomáš Vetrík
Publikováno v:
Afrika Matematika. 32:495-506
We define the general degree-eccentricity index of a connected graph G as $$DEI_{a,b}(G) = \sum _{v \in V(G)} d_{G}^{a}(v) ecc_{G}^{b}(v)$$ for $$a,b \in {\mathbb {R}}$$ , where V(G) is the vertex set of G, $$d_{G} (v)$$ is the degree of a vertex v a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f40bc06f583c43dc67735e89787473ef
https://doi.org/10.1007/s13370-020-00839-5
https://doi.org/10.1007/s13370-020-00839-5
Autor:
Tomáš Vetrík, Mesfin Masre
Publikováno v:
Discrete Applied Mathematics. 284:301-315
We introduce the general eccentric connectivity index of a graph G , E C I α ( G ) = ∑ v ∈ V ( G ) e c c G ( v ) d G α ( v ) for α ∈ R , where V ( G ) is the vertex set of G , e c c G ( v ) is the eccentricity of a vertex v and d G ( v ) is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c76c3bded3e911f5d7180804bb2fbcfc
https://doi.org/10.1016/j.dam.2020.03.051
https://doi.org/10.1016/j.dam.2020.03.051
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 15
The eccentric connectivity coindex of a graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the vertex set of [Formula: see text], [Formula: see text] is the edge set of [Formula: see text], [Formula: see text] i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34733a478e258394fbf1dedc10a8a746
https://doi.org/10.1142/s1793830922500549
https://doi.org/10.1142/s1793830922500549
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 12:2050041
Binary and [Formula: see text]-ary trees have extensive applications, particularly in computer science and chemistry. We present exact values of all important distance-based indices for complete [Formula: see text]-ary trees. We solve recurrence rela
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac5bb450a8aaf7a41383872a0b2f4ce4
https://doi.org/10.1142/s179383092050041x
https://doi.org/10.1142/s179383092050041x