I. Tomescu

activity

20082019

most citedGeneral sum-connectivity index of trees and unicyclic graphs with fixed maximum degree

5 citations · 8 across the 4 of their papers we have counts for

collaborators

5 papers

math.CO2019

Some Bounds on Zeroth-Order General Randić$ Index

Muhammad Kamran Jamil, Ioan Tomescu, Muhammad Imran

For a graph $G$ without isolated vertices, the inverse degree of a graph $G$ is defined as $I D (G) = \sum_{u \in V (G)} d (u)^{- 1}$ where $d (u)$ is the number of vertices adjacent to the…

math.CO2018★ 5 cited

General sum-connectivity index of trees and unicyclic graphs with fixed maximum degree

M. K. Jamil, I. Tomescu

The general sum-connectivity index of a graph $G$ is defined as $χ_{α} (G) = uv \in E (G) \sum (d (u) + d (v))^{α}$ , where $d (v)$ denotes the degree of the vertex $v$ in $G$ and $α$ …

math.CO2018★ 3 cited

Zeroth-order general Randic index of $k$ -generalized quasi trees

M. K. Jamil, I. Tomescu

For a simple graph $G (V, E)$ , the zeroth-order general Randi\' c index is defined as $^{0} R_{α} (G) = \sum_{v \in V (G)} d (v)^{α}$ , where $d (v)$ is the degree of the vertex $v$ and $α \neq = 0$ is a…

math.CO2015

Extremal k-apex Trees for Randic Index

Naveed Akhter, Muhammad Kamran Jamil, Ioan Tomescu

The Randic (connectivity) index is one of the most successful molecular descriptors in structure-property and structure-activity relationships studies. J. Gao found the sharp upper…

math.CO2008

On the Ramsey numbers for paths and generalized Jahangir graphs

Kashif Ali, Edy Tri Baskoro, Ioan Tomescu

For given graphs $G$ and $H,$ the \emph{Ramsey number} $R (G, H)$ is the least natural number $n$ such that for every graph $F$ of order $n$ the following condition holds: either $F$ …