Muhammad Asif

Muhammad Asif

Auto-generated profile, based on publicly available information

Muhammad Asif

Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan, Pakistan

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 April 2021 in Information Sciences
Verified
Journal Article
Closed access
AYAwais Younus
Awais Younus
MAMuhammad Asif
Muhammad Asif
KFKhurram Farhad
Khurram Farhad

7 December 2021 in Journal of Mathematics
Verified
Journal Article
Open access
PDF file
MAMuhammad Shahbaz Aasi
Muhammad Shahbaz Aasi
MAMuhammad Asif
Muhammad Asif
TITanveer Iqbal
Tanveer Iqbal
MIMuhammad Ibrahim
Muhammad Ibrahim
Labeling of graphs has defined many variations in the literature, e.g., graceful, harmonious, and radio labeling. Secrecy of data in data sciences and in information technology is very necessary as well as the accuracy of data transmission and different channel assignments is maintained. It enhances the graph terminologies for the computer programs. In this paper, we will discuss multidistance radio labeling used for channel assignment problems over wireless communication. A radio labeling is a one-to-one mapping satisfying the condition for any pair of vertices in . The span of labeling is the largest number that assigns to a vertex of a graph. Radio number of , denoted by , is the minimum span taken over all radio labelings of . In this article, we will find relations for radio number and radio mean number of a lexicographic product for certain families of graphs.

11 May 2023 in Soft Computing
Verified
Journal Article
Closed access
PDF file
AYAwais Younus
Awais Younus
MAMuhammad Asif
Muhammad Asif
UAUsama Atta
Usama Atta
TBTehmina Bashir
Tehmina Bashir
TAThabet Abdeljawad
Thabet Abdeljawad

3 November 2019 in Journal of Taibah University for Science
Verified
Journal Article
Open access
AYAwais Younus
Awais Younus
MAMuhammad Asif
Muhammad Asif
When observabilities of hybrid dynamic systems are considered, the distinguishability of subsystems takes a very important role. Necessary and sufficient conditions for distinguishability of linear dynamic systems are obtained. Some illustrative examples are presented.

1 June 2008 in Georgian Mathematical Journal
Verified
Journal Article
Closed access
MAMuhammad Asif
Muhammad Asif
AMAlexander Meskhi
Alexander Meskhi
The essential norm of the Hilbert transform acting in weighted Lebesgue spaces with variable exponent is estimated from below.

2 July 2015 in arXiv
Verified
Preprint
Open access
PDF file
IJImran Javaid
Imran Javaid
MMM. Murtaza
M. Murtaza
MAM. Asif
M. Asif
FIF. Iftikhar
F. Iftikhar
An automorphism on a graph $G$ is a bijective mapping on the vertex set $V(G)$, which preserves the relation of adjacency between any two vertices of $G$. An automorphism $g$ fixes a vertex $v$ if $g$ maps $v$ onto itself. The stabilizer of a set $S$ of vertices is the set of all automorphisms that fix vertices of $S$. A set $F$ is called fixing set of $G$, if its stabilizer is trivial. The fixing number of a graph is the cardinality of a smallest fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph if its fixing number and fixed number are both $k$. In this paper, we study the fixed number of a graph and give construction of a graph of higher fixed number from graph with lower fixed number. We find bound on $k$ in terms of diameter $d$ of a distance-transitive $k$-fixed graph.