I. Javaid

activity

20142021

most citedMinimum Fault-Tolerant, local and strong metric dimension of graphs

10 citations · 36 across the 18 of their papers we have counts for

collaborators

Showing 2016Show all

4 papers · 1 filter

math.CO2016

On the Distinguishing number of Functigraphs

Muhammad Fazil, Muhammad Mutaza, Usman Ali +1

Let $G_{1}$ and $G_{2}$ be disjoint copies of a graph $G$ , and let $g : V (G_{1}) \to V (G_{2})$ be a function. A functigraph $F_{G}$ consists of the vertex set $V(G_{1})\cup V(…

math.CO2016★ 2 cited

On Fixing number of Functigraphs

Muhammad Fazil, Imran Javaid, Muhammad Murtaza

The fixing number of a graph $G$ is the order of the smallest subset $S$ of its vertex set $V (G)$ such that stabilizer of $S$ in $G$ , $Γ_{S} (G)$ is trivial. Let $G_{1}$ and $G_{2}$ …

math.CO2016

On the Fractional fixing number of graphs

Hira Benish, Iqra Irshad, Min Feng +1

An automorphism group of a graph $G$ is the set of all permutations of the vertex set of $G$ that preserve adjacency and non adjacency of vertices in a graph. A fixing set of a gra…

math.CO2016

On the zero forcing number of corona and lexicographic product of graphs

I. Javaid, I. Irshad, M. Batool +1

The zero forcing number of a graph $G$ , denoted by $Z (G)$ , is the minimum cardinality of a set $S$ of black vertices (where vertices in $V (G) ∖ S$ are colored white) such th…