10 citations · 36 across the 18 of their papers we have counts for
6 papers · 2 filters
On some automorphism related parameters in graphs
Imran Javaid, Hira Benish, Usman Ali +1
In this paper, we deduce some properties of -sets of connected graphs. Also, we introduce the concept of fixing share of each vertex of a fixing set to see the participation…
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-\{…
Resolvability in Hypergraphs
Imran Javaid, Azeem Haider, Muhammad Salman +1
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergr…
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…