10 citations · 16 across the 6 of their papers we have counts for
6 papers · 1 filter
On Fixing number of Functigraphs
Muhammad Fazil, Imran Javaid, Muhammad Murtaza
The fixing number of a graph is the order of the smallest subset of its vertex set such that stabilizer of in , is trivial. Let and …
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 , denoted by , is the minimum cardinality of a set of black vertices (where vertices in are colored white) such th…
Minimum Fault-Tolerant, local and strong metric dimension of graphs
Muhammad Salman, Imran Javaid, Muhammad Anwar Chaudhry
In this paper, we consider three similar optimization problems: the fault-tolerant metric dimension problem, the local metric dimension problem and the strong metric dimension prob…
Locating-Dominating sets in Hypergraphs
Muhammad Fazil, Imran Javaid, Muhammad Salman +1
A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along wit…
Weak total resolving sets in graphs
Imran Javaid, Muhammad Salman, Mahr Murtaza +2
A set of vertices of is said to be a weak total resolving set for if is a resolving set for as well as for each , there is at least one element in $W-\{…
Resolving Share and Topological Index
Muhammad Salman, Imran Javaid, Muhammad Anwar Chaudhry
An atom of a molecular graph uniquely determines (resolves) a pair of atoms of if the distance between and is different from the distance between…