Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Murad Ul Islam Khan"'
Autor:
Chuanjun Zhang, Ghulam Haidar, Murad Ul Islam Khan, Faisal Yousafzai, Kostaq Hila, Asad Ul Islam Khan
Publikováno v:
Symmetry, Vol 15, Iss 3, p 708 (2023)
The distance between two vertices of a simple connected graph G, denoted as d(u,v), is the length of the shortest path from u to v and is always symmetrical. An ordered subset W=w1,w2,w3,⋯,wk of V(G) is a resolving set for G, if for ∀u,v∈V(G),
Externí odkaz:
https://doaj.org/article/d3f9f2c5d13a4759b550280312c88fda
Autor:
Asad Khan, Ghulam Haidar, Naeem Abbas, Murad Ul Islam Khan, Azmat Ullah Khan Niazi, Asad Ul Islam Khan
Publikováno v:
Mathematics, Vol 11, Iss 4, p 869 (2023)
The distance d(va,vb) between two vertices of a simple connected graph G is the length of the shortest path between va and vb. Vertices va,vb of G are considered to be resolved by a vertex v if d(va,v)≠d(vb,v). An ordered set W={v1,v2,v3,…,vs}⊆
Externí odkaz:
https://doaj.org/article/0472d2ba96db40feadb96e743d7be70e
Autor:
Muhammad Danish Zia, Esmail Hassan Abdullatif Al-Sabri, Faisal Yousafzai, Murad-ul-Islam Khan, Rashad Ismail, Mohammed M. Khalaf
Publikováno v:
AIMS Mathematics. 8:14449-14474
During the COVID-19 pandemic, identifying face masks with artificial intelligence was a crucial challenge for decision support systems. To address this challenge, we propose a quadratic Diophantine fuzzy decision-making model to rank artificial intel
The main objective of this paper is to investigate the class of left regular LA-semihyperrings with respect to their hyperideals. Then, produce the intresting characterizations of left regular LA-semihyperrings with respect to their hyperideals. In t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b00cf509ded3d54f4a725dacf6c7c43
Autor:
Hao Guan, Faisal Yousafzai, Muhammad Danish Zia, Murad-ul-Islam Khan, Muhammad Irfan, Kostaq Hila
Publikováno v:
Symmetry; Volume 15; Issue 1; Pages: 74
Intuitionistic fuzzy sets (IFS), Pythagorean fuzzy sets (PFS), and q-rung orthopair fuzzy sets (q-ROFS) are among those concepts which are widely used in real-world applications. However, these theories have their own limitations in terms of membersh
Publikováno v:
Journal of Intelligent & Fuzzy Systems. 32:1917-1930
Publikováno v:
Discrete Mathematics. 339:1682-1689
The generalized power of a simple graph G , denoted by G k , s , is obtained from G by blowing up each vertex into an s -set and each edge into a k -set, where 1 ? s ? k 2 . When s < k 2 , G k , s is always odd-bipartite. It is known that G k , k 2 i
Autor:
Yi-Zheng Fan, Murad-ul-Islam Khan
Publikováno v:
Linear Algebra and its Applications. 480:93-106
In order to investigate the non-odd-bipartiteness of even uniform hypergraphs, starting from a simple graph G, we construct a generalized power of G, denoted by G k , s , which is obtained from G by blowing up each vertex into a s-set and each edge i
Let G be a simple graph or hypergraph, and let A ( G ) , L ( G ) , Q ( G ) be the adjacency, Laplacian and signless Laplacian tensors of G respectively. The largest H-eigenvalues (respectively, the spectral radii) of L ( G ) , Q ( G ) are denoted res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b95360af97a7bc3e49efca7df62229d0
http://arxiv.org/abs/1510.02178
http://arxiv.org/abs/1510.02178
Linear Diophantine fuzzy sets over complex fuzzy information with applications in information theory
Autor:
Faisal Yousafzai, Muhammad Danish Zia, Murad-ul-Islam Khan, Mohammed. M. Khalaf, Rashad Ismail
Publikováno v:
Ain Shams Engineering Journal, Vol 15, Iss 1, Pp 102327- (2024)
This article aims to link AG-groupoids and complex fuzzy set theory by constructing a method to rank complex fuzzy information, provide an alternative definition of CLDFS, and an algorithm for data encryption/decryption using AG-groupoids. Achieving
Externí odkaz:
https://doaj.org/article/70b3a5d0b2974264a33f07258996a3a5