default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDI. Sahul Hamid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j19]I. Sahul Hamid
, H. Shanmuga Priya, S. Saravanakumar:
Equitable path decomposition of graphs. Discret. Math. Algorithms Appl. 17(2): 2450017:1-2450017:13 (2025)- 2024
- [j18]S. Anandha Prabhavathy, I. Sahul Hamid:
Majority double Roman domination in graphs. Discret. Math. Algorithms Appl. 16(6): 2350081:1-2350081:9 (2024) - [j17]David A. Kalarkop, Ismail Sahul Hamid, Mustapha Chellali, Raghavachar Rangarajan:
Global dominated coloring of graphs. Discuss. Math. Graph Theory 44(4): 1293-1309 (2024) - 2023
- [j16]I. Sahul Hamid, S. Anandha Prabhavathy:
Some results on majority bad number. Discret. Math. Algorithms Appl. 15(3): 2250098:1-2250098:10 (2023) - 2019
- [j15]S. Saravanakumar, A. Anitha, I. Sahul Hamid:
Open packing bondage number of a graph. Discret. Math. Algorithms Appl. 11(5): 1950051:1-1950051:8 (2019) - [j14]M. Rajeswari, Ismail Sahul Hamid:
Global dominator coloring of graphs. Discuss. Math. Graph Theory 39(2): 325-339 (2019) - 2017
- [j13]I. Sahul Hamid, M. Fatima Mary:
Criticality of outer - connected independence upon edge removal. Electron. Notes Discret. Math. 63: 361-369 (2017) - 2016
- [j12]I. Sahul Hamid, S. Anandha Prabhavathy:
Majority reinforcement number. Discret. Math. Algorithms Appl. 8(1): 1650014:1-1650014:13 (2016) - [j11]I. Sahul Hamid, S. Saravanakumar:
Changing and unchanging Open Packing: Edge removal. Discret. Math. Algorithms Appl. 8(1): 1650016:1-1650016:9 (2016) - [j10]Ismail Sahul Hamid, S. Balamurugan, A. Navaneethakrishnan:
A note on isolate domination. Electron. J. Graph Theory Appl. 4(1): 94-100 (2016) - 2015
- [j9]I. Sahul Hamid, S. Balamurugan:
Vertex criticality with respect to isolate domination. Discret. Math. Algorithms Appl. 7(2): 1550010:1-1550010:9 (2015) - [j8]I. Sahul Hamid, R. Gnanaprakasam, M. Fatima Mary:
Outer-connected independence in graphs. Discret. Math. Algorithms Appl. 7(3): 1550039:1-1550039:11 (2015) - [j7]Ismail Sahul Hamid, S. Saravanakumar:
Packing parameters in graphs. Discuss. Math. Graph Theory 35(1): 5-16 (2015) - 2014
- [j6]I. Sahul Hamid, M. Rajeswari:
Global dominating sets in minimum coloring. Discret. Math. Algorithms Appl. 6(3) (2014) - 2013
- [j5]I. Sahul Hamid, Mayamma Joseph:
Further Results on induced graphoidal Decomposition. Discret. Math. Algorithms Appl. 5(1) (2013) - 2012
- [j4]Ismail Sahul Hamid:
Independent transversal domination in graphs. Discuss. Math. Graph Theory 32(1): 5-17 (2012) - 2011
- [j3]I. Sahul Hamid, A. Anitha:
On the Label graphoidal Covering Number-II. Discret. Math. Algorithms Appl. 3(1): 1-8 (2011) - 2010
- [j2]S. Arumugam, Kalimuthu Karuppasamy, Ismail Sahul Hamid:
Fractional global domination in graphs. Discuss. Math. Graph Theory 30(1): 33-44 (2010) - 2007
- [j1]S. Arumugam, I. Sahul Hamid:
Simple acyclic graphoidal covers in a graph. Australas. J Comb. 37: 243-256 (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-06-16 23:56 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:
