4 citations · 4 across the 2 of their papers we have counts for
6 papers
Distinguishing Number of Non-Zero Component Graphs
I. Javaid, M. Murtaza, H. Benish
A non-zero component graph associated to a finite vector space is a graph whose vertices are non-zero vectors of and two vertices are adja…
The Fractional Local Metric Dimension of Graphs
Hira Benish, Muhammad Murtaza, Imran Javaid
The fractional versions of graph theoretic-invariants multiply the range of applications in scheduling, assignment and operational research problems. In this paper, we introduce th…
Automorphism related parameters of a graph associated to a finite vector space
Hira Benish, Imran Javaid, M. Murtaza
In this paper, we discuss automorphism related parameters of a graph associated to a finite vector space. The fixing neighborhood of a pair of vertices of a graph is th…
Locating-Dominating Sets of Functigraphs
Muhammad Murtaza, Muhammad Fazil, Imran Javaid +1
A locating-dominating set of a graph is a dominating set of such that every vertex of outside the dominating set is uniquely identified by its neighborhood within the d…
Locating-Dominating Sets and Identifying Codes of a Graph Associated to a Finite Vector Space
Muhammad Murtaza, Imran Javaid, Muhammad Fazil
In this paper, we investigate the problem of covering the vertices of a graph associated to a finite vector space as introduced by Das \cite{Das}, such that we can uniquely identif…
On The Fixed Number of Graphs
I. Javaid, M. Murtaza, M. Asif +1
An automorphism on a graph is a bijective mapping on the vertex set , which preserves the relation of adjacency between any two vertices of . An automorphism fixes…