M. Jamil

activity

20152021

most citedBounds of Zagreb indices and hyper Zagreb indices

9 citations · 26 across the 10 of their papers we have counts for

collaborators

11 papers

math.CO2021★ 2 cited

Further Results on Topological Indices of Two Corona Variants of Graph Products

Rao Tabish, Muhammad Kamran Jamil, Muhammad Waheed

Graph operations are crucial for building complicated network architectures from simple graphs. In [7], authors defined two new variants of Corona product and investigated some top…

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.CO2018★ 5 cited

Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs

Bo Bi, Muhammad Kamran Jamil, Khawaja Muhammad Fahd +3

Let $G = (V (G), E (G))$ be a molecular graph, where $V (G)$ and $E (G)$ are the sets of vertices (atoms) and edges (bonds). A topological index of a molecular graph is a numerical quanti…

math.GM2017★ 1 cited

Rainbow Neighbourhoods of Graphs

Johan Kok, Naduvath Sudev, Muhammad Kamran Jamil

In this paper, we introduce the notion of the rainbow neighbourhood and a related graph parameter namely, the rainbow neighbourhood number of a graph $G$ . We report on preliminary…