default search action
Edy Tri Baskoro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j54]Meysam Korivand, Doost Ali Mojdeh, Edy Tri Baskoro, Ahmad Erfanian:
Edge-locating coloring of graphs. Electron. J. Graph Theory Appl. 12(1): 55-73 (2024) - 2023
- [j53]Patrick Ali
, Edy Tri Baskoro:
Bounds on the Steiner radius of a graph. Discret. Math. Algorithms Appl. 15(7): 2250159:1-2250159:9 (2023) - [j52]Hilda Assiyatun, Maya Nabila
On Ramsey (C4, K1, n)-minimal graphs. Electron. J. Graph Theory Appl. 11(1): 149-154 (2023) - [j51]Mostafa Tavakoli, Meysam Korivand, Ahmad Erfanian
The dominant edge metric dimension of graphs. Electron. J. Graph Theory Appl. 11(1): 197-208 (2023) - [j50]Muhammad Ridwan
The dominating partition dimension and locating-chromatic number of graphs. Electron. J. Graph Theory Appl. 11(2): 455-465 (2023) - 2022
- [j49]Maya Nabila
Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star. Electron. J. Graph Theory Appl. 10(1): 289 (2022) - [j48]Shariefuddin Pirzada, Mushtaq Shah, Edy Tri Baskoro:
On 2-power unicyclic cubic graphs. Electron. J. Graph Theory Appl. 10(1): 337 (2022) - [j47]I Wayan Palton Anuwiksa, Rinovia Simanjuntak, Edy Tri Baskoro:
Multipartite Ramsey Numbers of Union of Stars. Electron. J. Graph Theory Appl. 10(2): 637-643 (2022) - 2021
- [j46]Edy Tri Baskoro, Nobuaki Obata
Determining finite connected graphs along the quadratic embedding constants of paths. Electron. J. Graph Theory Appl. 9(2): 539-560 (2021) - [j45]Edy Tri Baskoro, Devi Imulia Dian Primaskun:
Improved algorithm for the locating-chromatic number of trees. Theor. Comput. Sci. 856: 165-168 (2021) - 2020
- [j44]Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa:
On the restricted size Ramsey number for P3 versus dense connected graphs. Electron. J. Graph Theory Appl. 8(2): 383-389 (2020) - [j43]Rinovia Simanjuntak, Susilawati
Total vertex irregularity strength for trees with many vertices of degree two. Electron. J. Graph Theory Appl. 8(2): 415-421 (2020) - [j42]Hilda Assiyatun
Calculating an upper bound of the locating-chromatic number of trees. Theor. Comput. Sci. 806: 305-309 (2020)
2010 – 2019
- 2019
- [j41]Edy Tri Baskoro, Denny Riama Silaban
On the restricted size Ramsey number involving a path P3. Discuss. Math. Graph Theory 39(3): 757-769 (2019) - [j40]Hilda Assiyatun
The connected size Ramsey number for matchings versus small disconnected graphs. Electron. J. Graph Theory Appl. 7(1): 113-119 (2019) - [j39]Debi Oktia Haryeni
A method to construct graphs with certain partition dimension. Electron. J. Graph Theory Appl. 7(2): 251-263 (2019) - 2018
- [j38]Kristiana Wijaya
On Ramsey (4K2, P3)-minimal graphs. AKCE Int. J. Graphs Comb. 15(2): 174-186 (2018) - [j37]Susilawati
Total vertex irregularity strength of trees with maximum degree five. Electron. J. Graph Theory Appl. 6(2): 250-257 (2018) - 2017
- [j36]Anie Lusiani, Edy Tri Baskoro
On size multipartite Ramsey numbers for stars versus paths and cycles. Electron. J. Graph Theory Appl. 5(1): 43-50 (2017) - [j35]Denny Riama Silaban
Restricted size Ramsey number for path of order three versus graph of order five. Electron. J. Graph Theory Appl. 5(1): 155-162 (2017) - [j34]Kristiana Wijaya
On Ramsey (mK2,H)-Minimal Graphs. Graphs Comb. 33(1): 233-243 (2017) - 2016
- [j33]Chula J. Jayawardene, Edy Tri Baskoro
Size multipartite Ramsey numbers for stripes versus small cycles. Electron. J. Graph Theory Appl. 4(2): 157-170 (2016) - 2015
- [j32]I Wayan Sudarsana, Hilda Assiyatun, Saladin Uttunggadewa, Edy Tri Baskoro:
On the Ramsey Numbers R(S2, m, K2, q) and R(sK2, Ks+Cn). Ars Comb. 119: 235-246 (2015) - [j31]Ali Ahmad, Nurdin, Edy Tri Baskoro:
On total irregularity strength of generalized Halin graph. Ars Comb. 122: 319-332 (2015) - [j30]Hilal A. Ganie, Shariefuddin Pirzada, Edy Tri Baskoro
On energy, Laplacian energy and p-fold graphs. Electron. J. Graph Theory Appl. 3(1): 94-107 (2015) - [j29]Kristiana Wijaya, Edy Tri Baskoro
The complete list of Ramsey (2K2, K4)-minimal graphs. Electron. J. Graph Theory Appl. 3(2): 216-227 (2015) - [j28]Hadi Muhshi, Edy Tri Baskoro
Matching-Star Ramsey Minimal Graphs. Math. Comput. Sci. 9(4): 443-452 (2015) - [c22]Kristiana Wijaya
On Unicyclic Ramsey (mK2, P3)-Minimal Graphs. ICGTIS 2015: 10-14 - [c21]Desi Rahmadani, Edy Tri Baskoro
On Ramsey Minimal Graphs for the Pair Paths. ICGTIS 2015: 15-20 - [c20]Denny Riama Silaban
On The Restricted Size Ramsey Number. ICGTIS 2015: 21-26 - [c19]Anie Lusiani, Syafrizal Sy
On Size Multipartite Ramsey Numbers for Stars versus Cycles. ICGTIS 2015: 27-31 - [c18]Budi Rahadjeng, Edy Tri Baskoro
Connected Size Ramsey Numbers for Matchings versus Cycles or Paths. ICGTIS 2015: 32-37 - [c17]Amrullah
The Partition Dimension of a Subdivision of a Complete Graph. ICGTIS 2015: 53-59 - [c16]Ketut Queena Fredlina, Edy Tri Baskoro
The Partition Dimension of Some Families of Trees. ICGTIS 2015: 60-66 - [c15]K. Ida Bagus Kade Puja Arimbawa
Partition Dimension of Some Classes of Trees. ICGTIS 2015: 67-72 - [c14]Debi Oktia Haryeni
Partition Dimension of Some Classes of Homogenous Disconnected Graphs. ICGTIS 2015: 73-78 - [c13]Dian Kastika Syofyan, Edy Tri Baskoro
The Locating-Chromatic Number of Binary Trees. ICGTIS 2015: 79-83 - [c12]Ira Apni Purwasih, Edy Tri Baskoro
The Bounds on the Locating-Chromatic Number for a Subdivision of a Graph on One Edge. ICGTIS 2015: 84-88 - [c11]Des Welyyanti, Edy Tri Baskoro
On Locating-chromatic Number for Graphs with Dominant Vertices. ICGTIS 2015: 89-92 - [c10]Susilawati
Total Vertex-Irregularity Labelings for Subdivision of Several Classes of Trees. ICGTIS 2015: 112-117 - [c9]Denny Riama Silaban
Algorithm to Construct Graph with Total Vertex Irregularity Strength Two. ICGTIS 2015: 132-137 - [e2]Rinovia Simanjuntak, Edy Tri Baskoro, Mirka Miller:
The 2nd International Conference of Graph Theory and Information Security, ICGTIS 2015, Bandung, Indonesia, 21-23 September 2015. Procedia Computer Science 74, Elsevier 2015 [contents] - [i1]Edy Tri Baskoro:
Graphs with certain locating-chromatic number. CTW 2015: 258-260 - 2014
- [j27]Abdul Qudair Baig, Edy Tri Baskoro, Andrea Semanicová-Fenovcíková:
On the super edge-magic deficiency of a star forest. Ars Comb. 115: 3-12 (2014) - 2013
- [j26]Tita Khalis Maryati
Supermagic coverings of the disjoint union of graphs and amalgamations. Discret. Math. 313(4): 397-405 (2013) - [j25]Suhadi Wido Saputro
The metric dimension of the lexicographic product of graphs. Discret. Math. 313(9): 1045-1051 (2013) - [j24]Edy Tri Baskoro
Characterizing all trees with locating-chromatic number 3. Electron. J. Graph Theory Appl. 1(2): 109-117 (2013) - [c8]Mirka Miller, Slamin
Construction Techniques for Digraphs with Minimum Diameter. IWOCA 2013: 327-336 - 2012
- [j23]Muhammad Hussain, Edy Tri Baskoro, Kashif Ali:
On super antimagic total labeling of Harary graph. Ars Comb. 104: 225-233 (2012) - [j22]Ali Ahmad
Total vertex irregularity strength of disjoint union of Helm graphs. Discuss. Math. Graph Theory 32(3): 427-434 (2012) - 2011
- [j21]Ngurah Anak Agung Gede, Edy Tri Baskoro, Ioan Tomescu:
Magic graphs with pendant edges. Ars Comb. 99: 149-160 (2011) - [j20]Tomás Vetrík
Large bipartite Cayley graphs of given degree and diameter. Discret. Math. 311(4): 324-326 (2011) - [c7]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 - [c6]Nurjannah Syakrani
Comparison of PUMA and CUNWRAP to 2-D phase unwrapping. ICEEI 2011: 1-6 - 2010
- [j19]Nurdin
On the total vertex irregularity strength of trees. Discret. Math. 310(21): 3043-3048 (2010) - [j18]Edy Tri Baskoro
On Ramsey (K1, 2, C4)-minimal graphs. Discuss. Math. Graph Theory 30(4): 637-649 (2010)
2000 – 2009
- 2009
- [j17]I Wayan Sudarsana, Edy Tri Baskoro, Saladin Uttunggadewa, D. Ismaimuza:
An Expansion Technique on Super Edge-Magic Total Graphs. Ars Comb. 91 (2009) - 2008
- [j16]Ngurah Anak Agung Gede, Edy Tri Baskoro, Rinovia Simanjuntak:
On the super edge-magic deficiencies of graphs. Australas. J Comb. 40: 3-14 (2008) - [j15]Edy Tri Baskoro
Enumerations of vertex orders of almost Moore digraphs with selfrepeats. Discret. Math. 308(1): 123-128 (2008) - [j14]Hasmawati, Edy Tri Baskoro
The Ramsey numbers for disjoint unions of graphs. Discret. Math. 308(10): 2046-2049 (2008) - [j13]Surahmat, Edy Tri Baskoro
The Ramsey Numbers of Large cycles Versus Odd Wheels. Graphs Comb. 24(1): 53-58 (2008) - 2007
- [c5]Hasmawati, Hilda Assiyatun
Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle. KyotoCGGT 2007: 85-89 - [c4]Ngurah Anak Agung Gede, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa:
On Super Edge-Magic Strength and Deficiency of Graphs. KyotoCGGT 2007: 144-154 - 2006
- [j12]Edy Tri Baskoro
The Ramsey numbers for disjoint unions of trees. Discret. Math. 306(24): 3297-3301 (2006) - [j11]Surahmat, Edy Tri Baskoro
The Ramsey numbers of large cycles versus wheels. Discret. Math. 306(24): 3334-3337 (2006) - 2005
- [j10]Edy Tri Baskoro
The Ramsey number of paths with respect to wheels. Discret. Math. 294(3): 275-277 (2005) - [j9]Edy Tri Baskoro
Complete characterization of almost Moore digraphs of degree three. J. Graph Theory 48(2): 112-126 (2005) - [e1]Jin Akiyama, Edy Tri Baskoro, Mikio Kano:
Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers. Lecture Notes in Computer Science 3330, Springer 2005, ISBN 3-540-24401-8 [contents] - 2003
- [j8]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) - [c3]Martin Baca, Edy Tri Baskoro, Mirka Miller:
Antimagic Valuations for the Special Class of Plane Graphs. IJCCGGT 2003: 58-64 - [c2]Yus Mochamad Cholily
Some Conditions for the Existence of ( d, k)-Digraphs. IJCCGGT 2003: 87-93 - [c1]Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma
An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels. IJCCGGT 2003: 181-184 - 2002
- [j7]Edy Tri Baskoro
On Ramsey Numbers for Trees Versus Wheels of Five or Six Vertices. Graphs Comb. 18(4): 717-721 (2002) - 2000
- [j6]Walter D. Wallis, Edy Tri Baskoro, Mirka Miller, Slamin:
Edge-magic total labelings. Australas. J Comb. 22: 177-190 (2000) - [j5]Edy Tri Baskoro, Mirka Miller, Ján Plesník:
Further results on almost Moore digraphs. Ars Comb. 56 (2000)
1990 – 1999
- 1998
- [j4]Edy Tri Baskoro
On the Structure of Digraphs with Order Close to the Moore Bound. Graphs Comb. 14(2): 109-119 (1998) - 1995
- [j3]Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stefan Znám:
Regular digraphs of diamter 2 and maximum order: Corrigenda. Australas. J Comb. 12: 305- (1995) - [j2]Edy Tri Baskoro
Digraphs of degree 3 and order close to the moore bound. J. Graph Theory 20(3): 339-349 (1995) - 1994
- [j1]Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stephan Znám:
Regular digraphs of diameter 2 and maximum order. Australas. J Comb. 9: 291-306 (1994)
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-07 21:21 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: