default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDImran Javaid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Abeer Fatima, Imran Javaid
:
Rough set theory applied to finite dimensional vector spaces. Inf. Sci. 659: 120072 (2024)- 2023
- [j18]Imran Javaid, Azeem Haider, Muhammad Salman, Sadaf Mehtab:
Resolvability in Hypergraphs. Contributions Discret. Math. 18(2): 176-187 (2023) - 2021
- [i1]Imran Javaid, Shahroz Ali, Shahid ur Rehman, Aqsa Shah:
Rough Sets in Graphs Using Similarity Relations. CoRR abs/2104.08743 (2021) - 2020
- [j17]Shahid ur Rehman, Muhammad Imran, Imran Javaid:
On the Metric Dimension of Arithmetic Graph of a Composite Number. Symmetry 12(4): 607 (2020) - [c1]Imran Javaid, Shuai Zhang, Isselmou Abd El Kader, Souha Kamhi, Ummay Kulsum, Isah Salim Ahmad:
Hybrid Automated Brain Tumor Detection by Using FKM, KFCM Algorithm with Skull Stripping. ICBBS 2020: 112-119
2010 – 2019
- 2019
- [j16]Muhammad Murtaza, Muhammad Fazil, Imran Javaid:
Locating-dominating sets of functigraphs. Theor. Comput. Sci. 799: 115-123 (2019) - 2018
- [j15]Muhammad Naeem Azhar, Imran Javaid:
Metric Basis in Circulant Networks. Ars Comb. 136: 277-286 (2018) - [j14]Muhammad Salman, Imran Javaid, Muhammad Anwar Chaudhry:
Minimum Fault-Tolerant, local and strong metric dimension of graphs. Ars Comb. 138: 333-353 (2018) - [j13]Muhammad Fazil, Muhammad Murtaza, Zafar Ullah, Usman Ali, Imran Javaid:
On the Distinguishing Number of Functigraphs. Symmetry 10(8): 332 (2018) - 2016
- [j12]Muhammad Fazil, Imran Javaid, Muhammad Salman, Usman Ali:
Locating-dominating sets in hypergraphs. Period. Math. Hung. 72(2): 224-234 (2016) - 2015
- [j11]Muhammad Imran, Muhammad Salman, Mezab-e-Rehmat, Imran Javaid:
The crossing number of chordal ring networks. Period. Math. Hung. 71(2): 193-209 (2015) - 2014
- [j10]Zafar Ullah, Imran Javaid, Muhammad Anwar Chaudhry:
On Generalized Triple Derivations On Lattices. Ars Comb. 113: 463-471 (2014) - 2013
- [j9]Muhammad Salman, Muhammad Anwar Chaudhry, Imran Javaid:
On the locatic number of graphs. Int. J. Comput. Math. 90(5): 912-920 (2013) - 2012
- [j8]Muhammad Imran, Abdul Qudair Baig, Syed Ahtsham Ul Haq Bokhary, Imran Javaid:
On the metric dimension of circulant graphs. Appl. Math. Lett. 25(3): 320-325 (2012) - [j7]Imran Javaid, Shabbir Ahmad, Muhammad Naeem Azhar:
On the Metric Dimension of Generalized Petersen Graphs. Ars Comb. 105: 171-182 (2012) - [j6]Abdul Rauf Khan, Muhammad Anwar Chaudhry, Imran Javaid:
On (α, β)-generalized derivations on lattices. Ars Comb. 105: 525-533 (2012) - 2011
- [j5]Ali Ahmad, K. M. Awan, Imran Javaid, Slamin:
Total vertex irregularity strength of wheel related graphs. Australas. J Comb. 51: 147-156 (2011) - [j4]Ali Ahmad, Muhammad Faisal Nadeem, Imran Javaid, Roslan Hasni:
On the super edge-magic deficiency of some families related to ladder graphs. Australas. J Comb. 51: 201-208 (2011) - [j3]Ali Ahmad, Imran Javaid, Muhammad Faisal Nadeem:
Further results on super edge magic deficiency of unicyclic graphs. Ars Comb. 99: 129-138 (2011) - 2010
- [j2]M. Tariq Rahim, Kashif Ali, Imran Javaid:
On antimagic total labeling of some families of graphs. Ars Comb. 95 (2010)
2000 – 2009
- 2007
- [j1]Ioan Tomescu, Imran Javaid, Slamin:
On the partition dimension and connected partition dimension of wheels. Ars Comb. 84 (2007)
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 2025-01-20 23:59 CET 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:
