default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. N. M. Salman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]A. N. M. Salman, Arief Hakim
, Khreshna Syuhada:
Generalized coefficients of clustering in (un)directed and (un)weighted networks: An application to systemic risk quantification for cryptocoin markets. Commun. Nonlinear Sci. Numer. Simul. 135: 108046 (2024)- [j25]Tita Khalis Maryati, Fawwaz Fakhrurrozi Hadiputra, A. N. M. Salman:
Forbidden family of Ph-magic graphs. Electron. J. Graph Theory Appl. 12(1): 43-54 (2024) - 2023
- [j24]Yeva Fadhilah Ashari, A. N. M. Salman, Rinovia Simanjuntak, Andrea Semanicová-Fenovcíková, Martin Baca:
On (F, H)-simultaneously-magic labelings of graphs. Electron. J. Graph Theory Appl. 11(1): 49-64 (2023) - [j23]Rian Febrian Umbara, A. N. M. Salman, Pritta Etriana Putri:
On the inverse graph of a finite group and its rainbow connection number. Electron. J. Graph Theory Appl. 11(1): 135-147 (2023) - 2022
- [j22]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) - [j21]Dinny Fitriani, A. N. M. Salman, Zata Yumni Awanis:
Rainbow connection number of comb product of graphs. Electron. J. Graph Theory Appl. 10(2): 461-474 (2022) - 2021
- [j20]Meilin I. Tilukay, Pranaya D. M. Taihuttu, A. N. M. Salman, Francis Y. Rumlawang, Zeth A. Leleury:
Complete bipartite graph is a totally irregular total graph. Electron. J. Graph Theory Appl. 9(2): 387-396 (2021) - [j19]Yeva Fadhilah Ashari, A. N. M. Salman, Rinovia Simanjuntak:
On Forbidden Subgraphs of (K2, H)-Sim-(Super)Magic Graphs. Symmetry 13(8): 1346 (2021) - 2020
- [j18]Meilin I. Tilukay, A. N. M. Salman, Venn Y. I. Ilwaru, Francis Y. Rumlawang:
The total face irregularity strength of some plane graphs. AKCE Int. J. Graphs Comb. 17(1): 495-502 (2020) - [j17]Bety Hayat Susanti, A. N. M. Salman, Rinovia Simanjuntak:
The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths. Electron. J. Graph Theory Appl. 8(1): 145-156 (2020) - [j16]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
- 2016
- [j15]Dinny Fitriani, A. N. M. Salman:
Rainbow connection number of amalgamation of some graphs. AKCE Int. J. Graphs Comb. 13(1): 90-99 (2016) - 2015
- [j14]Rismawati Ramdani, A. N. M. Salman, Hilda Assiyatun, Andrea Semanicová-Fenovcíková, Martin Baca:
Total Irregularity Strength of Three Families of Graphs. Math. Comput. Sci. 9(2): 229-237 (2015) - [c11]Rismawati Ramdani, A. N. M. Salman, Hilda Assiyatun:
An Upper Bound On the Total Vertex Irregularity Strength of the Cartesian Product of P2 and an Arbitrary Regular Graph. ICGTIS 2015: 105-111 - [c10]Meilin I. Tilukay, A. N. M. Salman, E. R. Persulessy:
On the Total Irregularity Strength of Fan, Wheel, Triangular Book, and Friendship Graphs. ICGTIS 2015: 124-131 - [c9]Dian N. S. Simamora, A. N. M. Salman:
The Rainbow (Vertex) Connection Number of Pencil Graphs. ICGTIS 2015: 138-142 - [c8]D. Resty, A. N. M. Salman:
The Rainbow Connection Number of an n-Crossed Prism Graph and its Corona Product with a Trivial Graph. ICGTIS 2015: 143-150 - [c7]Bety Hayat Susanti, A. N. M. Salman, Rinovia Simanjuntak:
Upper Bounds for Rainbow 2-Connectivity of the Cartesian Product of a Path and a Cycle. ICGTIS 2015: 151-154 - [c6]S. Nabila, A. N. M. Salman:
The Rainbow Connection Number of Origami Graphs and Pizza Graphs. ICGTIS 2015: 162-167 - [c5]Irvania Sukma Kumala, A. N. M. Salman:
The Rainbow Connection Number of a Flower (Cm, Kn) Graph and a Flower (C3, Fn) Graph. ICGTIS 2015: 168-172 - 2013
- [j13]Nur Inayah, Rinovia Simanjuntak, A. N. M. Salman, K. I. A. Syuhada:
Super (a, d)-H-antimagic total labelings for shackles of a connected graph H. Australas. J Comb. 57: 127-138 (2013) - [j12]Tita Khalis Maryati, A. N. M. Salman, Edy Tri Baskoro:
Supermagic coverings of the disjoint union of graphs and amalgamations. Discret. Math. 313(4): 397-405 (2013) - [j11]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
- [c4]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 - 2010
- [j10]Ngurah Anak Agung Gede, A. N. M. Salman, Liliek Susilowati:
H-supermagic labelings of graphs. Discret. Math. 310(8): 1293-1300 (2010) - [j9]Nurdin, Edy Tri Baskoro, A. N. M. Salman, N. N. Gaos:
On the total vertex irregularity strength of trees. Discret. Math. 310(21): 3043-3048 (2010)
2000 – 2009
- 2009
- [j8]Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto:
lambda-backbone colorings along pairwise disjoint stars and matchings. Discret. Math. 309(18): 5596-5609 (2009) - [j7]Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman:
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discuss. Math. Graph Theory 29(1): 143-162 (2009) - 2007
- [j6]A. N. M. Salman, Haitze J. Broersma:
Path-kipas Ramsey numbers. Discret. Appl. Math. 155(14): 1878-1884 (2007) - [j5]A. N. M. Salman, Hajo Broersma:
On Ramsey numbers for paths versus wheels. Discret. Math. 307(7-8): 975-982 (2007) - [c3]Hasmawati, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman:
Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle. KyotoCGGT 2007: 85-89 - [c2]Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman:
Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. SOFSEM (1) 2007: 188-199 - 2006
- [j4]A. N. M. Salman, Hajo Broersma:
Path-fan Ramsey numbers. Discret. Appl. Math. 154(9): 1429-1436 (2006) - 2004
- [j3]A. N. M. Salman, Haitze J. Broersma:
The Ramsey Numbers of Paths Versus Kipases. Electron. Notes Discret. Math. 17: 251-255 (2004) - [c1]A. N. M. Salman, Hajo Broersma:
The Ramsey Numbers of Paths Versus Kipases. CTW 2004: 218-222 - 2003
- [j2]A. N. M. Salman, Haitze J. Broersma:
The Ramsey Numbers of Paths Versus Fans. Electron. Notes Discret. Math. 13: 103-107 (2003) - [j1]A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro:
Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs. J. Autom. Lang. Comb. 8(4): 675-681 (2003)
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-10-09 20:31 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:
