3 citations · 8 across the 5 of their papers we have counts for
5 papers
On fixing sets of composition and corona product of graphs
I. Javaid, M. S. Aasi, I. Irshad +1
A fixing set of a graph is a set of those vertices of the graph which when assigned distinct labels removes all the automorphisms from the graph except the tr…
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…