default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZohaib Zahid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Ruby Nasir, Muhammad Ahmad, Zohaib Zahid, Muhammad Javaid, Mamo Abebe Ashebo:
Edge Version of Doubly Resolving Sets for Grid and Generalized Prism Networks. IEEE Access 12: 20509-20516 (2024)- [j13]Ruby Nasir, Muhammad Ahmad, Zohaib Zahid, Muhammad Javaid, Mamo Abebe Ashebo:
Corrections to "Edge Version of Doubly Resolving Sets for Grid and Generalized Prism Networks". IEEE Access 12: 117471 (2024) - 2023
- [j12]Muhammad Ahmad, Zohaib Zahid, Muhammad Javaid, Mamo Abebe Ashebo
:
A Study on Minimal Doubly Resolving Sets of Certain Families of Networks. IEEE Access 11: 56344-56352 (2023) - [j11]Asim Nadeem, Agha Kashif, Sohail Zafar, Zohaib Zahid:
On 2-partition dimension of rotationally-symmetric graphs. Discret. Math. Algorithms Appl. 15(7): 2250153:1-2250153:11 (2023) - 2021
- [j10]Junya Lv, Xiaodong Lv, Ruby Nasir, Zohaib Zahid:
The Edge Version of Metric Dimension for the Family of Circulant Graphs Cₙ(1, 2). IEEE Access 9: 78165-78173 (2021) - [j9]Kamran Azhar, Sohail Zafar, Agha Kashif, Zohaib Zahid:
On fault-tolerant partition dimension of graphs. J. Intell. Fuzzy Syst. 40(1): 1129-1135 (2021) - [j8]Asim Nadeem, Agha Kashif, Sohail Zafar, Zohaib Zahid:
On 2-partition dimension of the circulant graphs. J. Intell. Fuzzy Syst. 40(5): 9493-9503 (2021) - [j7]Humera Bashir, Zohaib Zahid, Agha Kashif, Sohail Zafar, Jia-Bao Liu:
On 2-metric resolvability in rotationally-symmetric graphs. J. Intell. Fuzzy Syst. 40(6): 11887-11895 (2021) - 2020
- [j6]Ruby Nasir, Zohaib Zahid, Sohail Zafar:
Edge version of metric dimension for the families of grid graphs and generalized prism graphs. Discret. Math. Algorithms Appl. 12(3): 2050037:1-2050037:10 (2020) - [j5]Muhammad Ahmad, Naeem Ameen, Zohaib Zahid, Sohail Zafar:
Computing edge version of metric and double metric dimensions of Kayak paddle graphs. Discret. Math. Algorithms Appl. 12(5): 2050070:1-2050070:14 (2020)
2010 – 2019
- 2019
- [j4]Wei Gao, Muhammad Shoaib Sardar, Sohail Zafar, Zohaib Zahid:
Coordinate descent based ontology sparse vector computing strategy and its applications. Clust. Comput. 22(Supplement): 10309-10323 (2019) - 2016
- [j3]Muhammad Faisal Nadeem, Sohail Zafar, Zohaib Zahid:
On topological properties of the line graphs of subdivision graphs of certain nanostructures. Appl. Math. Comput. 273: 125-130 (2016) - 2015
- [j2]Muhammad Faisal Nadeem, Sohail Zafar, Zohaib Zahid:
On certain topological indices of the line graph of subdivision graphs. Appl. Math. Comput. 271: 790-794 (2015) - 2013
- [j1]Sohail Zafar, Zohaib Zahid:
On the Betti Numbers of some Classes of Binomial Edge Ideals. Electron. J. Comb. 20(4): 37 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-19 00:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
