10 citations · 36 across the 18 of their papers we have counts for
21 papers
Rough Sets in Graphs Using Similarity Relations
Imran Javaid, Shahroz Ali, Shahid Ur Rehman +1
In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits…
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…
Soft Rough Graphs
R. Noor, I. Irshad, I. Javaid
Soft set theory and rough set theory are mathematical tools to deal with uncertainties. In [3], authors combined these concepts and introduced soft rough sets. In this paper, we in…