default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Ghebleh
Person information
- affiliation: Kuwait University, Department of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j29]Mohammad Ghebleh, Salem M. Al-Yakoob, Ali A. Kanso, Dragan Stevanovic:
Reinforcement learning for graph theory, II. Small Ramsey numbers. Art Discret. Appl. Math. 8(1): 1 (2025)- [j28]Mohammad Ghebleh
, Salem M. Al-Yakoob, Ali A. Kanso, Dragan Stevanovic:
Graphs having two main eigenvalues and arbitrarily many distinct vertex degrees. Appl. Math. Comput. 495: 129311 (2025) - [j27]Mohammad Ghebleh, Ali A. Kanso:
On the second-order Wiener ratios of iterated line graphs. Comput. Appl. Math. 44(1): 133 (2025) - 2024
- [j26]Dragan Stevanovic, Mohammad Ghebleh, Gilles Caporossi, Ambat Vijayakumar, Sanja Stevanovic:
On regular triangle-distinct graphs. Comput. Appl. Math. 43(6): 336 (2024) - 2020
- [j25]Ali A. Kanso, Mohammad Ghebleh, Abdullah Alazemi:
A Lossless Linear Algebraic Secret Image Sharing Scheme. Informatica 31(3): 499-522 (2020) - [j24]Ali A. Kanso, Mohammad Ghebleh, Abdullah Alazemi:
Efficient Image Encryption Scheme Based on 4-Dimensional Chaotic Maps. Informatica 31(4): 793-820 (2020)
2010 – 2019
- 2019
- [j23]Mohammad Ghebleh, Ali A. Kanso:
A novel efficient image encryption scheme based on chained skew tent maps. Neural Comput. Appl. 31(7): 2415-2430 (2019) - 2018
- [j22]Ali A. Kanso, Mohammad Ghebleh:
An efficient lossless secret sharing scheme for medical images. J. Vis. Commun. Image Represent. 56: 245-255 (2018) - [j21]Mohammad Ghebleh, Ali A. Kanso, Dragan Stevanovic:
A novel image encryption algorithm based on piecewise linear chaotic maps and least squares approximation. Multim. Tools Appl. 77(6): 7305-7326 (2018) - [j20]Mohammad Ghebleh, Ali A. Kanso:
A novel secret image sharing scheme using large primes. Multim. Tools Appl. 77(10): 11903-11923 (2018) - 2017
- [j19]Ali A. Kanso, Mohammad Ghebleh:
An efficient (t, n)-threshold secret image sharing scheme. Multim. Tools Appl. 76(15): 16369-16388 (2017) - 2016
- [j18]Mohammad Ghebleh, Ali A. Kanso, Dragan Stevanovic:
Open quipus with the same Wiener index as their quadratic line graph. Appl. Math. Comput. 281: 130-136 (2016) - 2015
- [j17]Ali A. Kanso, Mohammad Ghebleh:
An efficient and robust image encryption scheme for medical applications. Commun. Nonlinear Sci. Numer. Simul. 24(Issues): 98-116 (2015) - [j16]Ali A. Kanso, Mohammad Ghebleh, Hassan Noura:
A variant of Baptista's encryption scheme. Secur. Commun. Networks 8(18): 3701-3712 (2015) - 2014
- [j15]Mohammad Ghebleh, Ali A. Kanso:
A robust chaotic algorithm for digital image steganography. Commun. Nonlinear Sci. Numer. Simul. 19(6): 1898-1907 (2014) - [j14]Mohammad Ghebleh, Ali A. Kanso, Hala S. Own:
A blind chaos-based watermarking technique. Secur. Commun. Networks 7(4): 800-811 (2014) - [j13]Mohammad Ghebleh, Ali A. Kanso, Hassan Noura:
An image encryption scheme based on irregularly decimated chaotic maps. Signal Process. Image Commun. 29(5): 618-627 (2014) - 2013
- [j12]Ali A. Kanso, Mohammad Ghebleh:
A fast and efficient chaos-based keyed hash function. Commun. Nonlinear Sci. Numer. Simul. 18(1): 109-123 (2013) - [j11]Mohammed Almulla, Ali A. Kanso, Mohammad Ghebleh:
A concurrent key exchange protocol based on commuting matrices. Concurr. Comput. Pract. Exp. 25(5): 743-751 (2013) - [j10]Mohammad Ghebleh, Ludovít Niepel:
Locating and identifying codes in circulant networks. Discret. Appl. Math. 161(13-14): 2001-2007 (2013) - [j9]Mohammad Ghebleh:
On the set of circular total chromatic numbers of graphs. Discret. Math. 313(5): 693-697 (2013) - 2012
- [i1]Mohammad Ghebleh, Ludovít Niepel:
Locating and Identifying Codes in Circulant Networks. CoRR abs/1207.4660 (2012)
2000 – 2009
- 2008
- [j8]Mohammad Ghebleh:
Circular Chromatic Index of Generalized Blanusa Snarks. Electron. J. Comb. 15(1) (2008) - [j7]Mohammad Ghebleh, Mahdad Khatirinejad:
Planarity of iterated line graphs. Discret. Math. 308(1): 144-147 (2008) - [j6]Mohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mahmoodian, Maryam Verdian-Rizi:
Silver Cubes. Graphs Comb. 24(5): 429-442 (2008) - 2007
- [j5]Mohammad Ghebleh:
The circular chromatic index of Goldberg snarks. Discret. Math. 307(24): 3220-3225 (2007) - [j4]Matt DeVos, Javad B. Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr:
Circular Coloring the Plane. SIAM J. Discret. Math. 21(2): 461-465 (2007) - 2006
- [j3]Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas:
The Circular Chromatic Index of Flower Snarks. Electron. J. Comb. 13(1) (2006) - 2002
- [j2]Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabolhassan, M. Mirzazadeh, Sayyed Bashir Sadjad:
Uniquely 2-list colorable graphs. Discret. Appl. Math. 119(3): 217-225 (2002) - 2001
- [j1]Mohammad Ghebleh, Ebadollah S. Mahmoodian:
On Uniquely List Colorable Graphs. Ars Comb. 59 (2001)
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-03-11 19: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:
