default search action
Sakander Hayat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Sakander Hayat
, Azri Arfan, Asad Khan
An Optimization Problem for Computing Predictive Potential of General Sum/Product-Connectivity Topological Indices of Physicochemical Properties of Benzenoid Hydrocarbons. Axioms 13(6): 342 (2024) - [j21]Sakander Hayat
On Some Distance Spectral Characteristics of Trees. Axioms 13(8): 494 (2024) - [j20]Mamoon Abdullah, Brhane Gebremichel
Distance-regular graphs with a few q-distance eigenvalues. Discret. Math. 347(5): 113926 (2024) - [j19]Sakander Hayat
Characterizations of Minimal Dominating Sets in γ-Endowed and Symmetric γ-Endowed Graphs with Applications to Structure-Property Modeling. Symmetry 16(6): 663 (2024) - 2023
- [j18]Muhammad Arshad, Sakander Hayat
The domination number of the king's graph. Comput. Appl. Math. 42(6): 251 (2023) - [j17]Sakander Hayat
Proofs to Some Open Problems on the Maximum Sombor Index of Graphs. Comput. Appl. Math. 42(6): 279 (2023) - [j16]Amina Arif, Sakander Hayat
On irregularity indices and main eigenvalues of graphs and their applicability. J. Appl. Math. Comput. 69(3): 2549-2571 (2023) - 2022
- [j15]Asad Khan
Cross-modal retrieval based on deep regularized hashing constraints. Int. J. Intell. Syst. 37(9): 6508-6530 (2022) - [j14]Yubin Zhong, Sakander Hayat
Hamilton-connectivity of line graphs with application to their detour index. J. Appl. Math. Comput. 68(2): 1193-1226 (2022) - 2021
- [j13]Sakander Hayat
A Computer-Based Method to Determine Predictive Potential of Distance-Spectral Descriptors for Measuring the π-Electronic Energy of Benzenoid Hydrocarbons With Applications. IEEE Access 9: 19238-19253 (2021) - [j12]Sakander Hayat
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index. Complex. 2021: 6684784:1-6684784:23 (2021) - [j11]Asad Khan, Sakander Hayat
Learning-detailed 3D face reconstruction based on convolutional neural networks from a single image. Neural Comput. Appl. 33(11): 5951-5964 (2021) - 2020
- [j10]Sakander Hayat
Fault-Tolerant Metric Dimension of Interconnection Networks. IEEE Access 8: 145435-145445 (2020) - [j9]Jing Zhao
Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs. J. Appl. Math. Comput. 63(1-2): 1-27 (2020)
2010 – 2019
- 2019
- [j8]Sakander Hayat, Muhammad Imran, Jia-Bao Liu
An Efficient Computational Technique for Degree and Distance Based Topological Descriptors With Applications. IEEE Access 7: 32276-32296 (2019) - [j7]Sakander Hayat, Jack H. Koolen
A spectral characterization of the s-clique extension of the square grid graphs. Eur. J. Comb. 76: 104-116 (2019) - [j6]Hassan Raza, Sakander Hayat
On the fault-tolerant metric dimension of certain interconnection networks. J. Appl. Math. Comput. 60(1-2): 517-535 (2019) - [j5]Hafiz Muhammad Afzal Siddiqui
Resolvability and fault-tolerant resolvability structures of convex polytopes. Theor. Comput. Sci. 796: 114-128 (2019) - 2018
- [j4]Hassan Raza, Sakander Hayat, Xiang-Feng Pan
On the fault-tolerant metric dimension of convex polytopes. Appl. Math. Comput. 339: 172-185 (2018) - [j3]Hassan Raza, Sakander Hayat
Binary Locating-Dominating Sets in Rotationally-Symmetric Convex Polytopes. Symmetry 10(12): 727 (2018) - 2014
- [j2]Sakander Hayat, Muhammad Imran:
Computation of topological indices of certain networks. Appl. Math. Comput. 240: 213-228 (2014) - [j1]Muhammad Imran, Sakander Hayat, Muhammad Yasir Hayat Malik
On topological indices of certain interconnection networks. Appl. Math. Comput. 244: 936-951 (2014)
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-12-23 19:33 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: