default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuhadi Wido Saputro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Dinny Fitriani, Suhadi Wido Saputro:
The local metric dimension of amalgamation of graphs. Electron. J. Graph Theory Appl. 12(1): 125-146 (2024)- 2022
- [j10]Zata Yumni Awanis
, A. N. M. Salman, Suhadi Wido Saputro:
The strong 3-rainbow index of edge-comb product of a path and a connected graph. Electron. J. Graph Theory Appl. 10(1): 33 (2022) - [j9]Darmaji, Rinurwati, Suhud Wahyudi, Suhadi Wido Saputro:
On the construction of super edge-magic total graphs. Electron. J. Graph Theory Appl. 10(1): 301 (2022) - 2020
- [j8]Faraha Ashraf, Martin Baca, Andrea Semanicová-Fenovcíková, Suhadi Wido Saputro:
On cycle-irregularity strength of ladders and fan graphs. Electron. J. Graph Theory Appl. 8(1): 181-194 (2020) - [j7]Dimas Agus Fahrudin, Suhadi Wido Saputro:
The geodetic domination number of comb product graphs. Electron. J. Graph Theory Appl. 8(2): 373-381 (2020) - [j6]Zata Yumni Awanis, A. N. M. Salman, Suhadi Wido Saputro:
The Strong 3-rainbow Index of Comb Product of a Tree and a Connected Graph. J. Inf. Process. 28: 865-875 (2020)
2010 – 2019
- 2019
- [j5]Debi Oktia Haryeni, Edy Tri Baskoro, Suhadi Wido Saputro:
A method to construct graphs with certain partition dimension. Electron. J. Graph Theory Appl. 7(2): 251-263 (2019) - 2018
- [j4]Hafizh M. Radiapradana, Suhadi Wido Saputro, Erma Suwastika, Oki Neswan, Andrea Semanicová-Fenovcíková:
On topological integer additive set-labeling of star graphs. Electron. J. Graph Theory Appl. 6(2): 341-346 (2018) - 2017
- [j3]Anie Lusiani, Edy Tri Baskoro, Suhadi Wido Saputro:
On size multipartite Ramsey numbers for stars versus paths and cycles. Electron. J. Graph Theory Appl. 5(1): 43-50 (2017) - [j2]Suhadi Wido Saputro:
On the Metric Dimension of Biregular Graph. J. Inf. Process. 25: 634-638 (2017) - 2015
- [c3]Daniel A. Krismanto, Suhadi Wido Saputro:
Fractional Metric Dimension of Tree and Unicyclic Graph. ICGTIS 2015: 47-52 - [i2]Suhadi Wido Saputro:
The locating chromatic number of (n-3)-regular graphs. CTW 2015: 109-112 - [i1]Gabriel A. Barragán-Ramírez, Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro:
Local metric dimension of subgraph-amalgamation of graphs. CTW 2015: 285-288 - 2014
- [c2]Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro:
Metric Dimension for Amalgamations of Graphs. IWOCA 2014: 330-337 - 2013
- [j1]Suhadi Wido Saputro, Rinovia Simanjuntak, Saladin Uttunggadewa, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman, Martin Baca:
The metric dimension of the lexicographic product of graphs. Discret. Math. 313(9): 1045-1051 (2013) - 2011
- [c1]Suhadi Wido Saputro, Rinovia Simanjuntak, Saladin Uttunggadewa, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman:
On graph of order-n with the metric dimension n-3. CTW 2011: 239-243
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-05-19 00:16 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:
