Edy Tri Baskoro

Orcid: 0000-0003-0492-5142

According to our database1, Edy Tri Baskoro authored at least 77 papers between 1994 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Edge-locating coloring of graphs.
Electron. J. Graph Theory Appl., 2024

2023
Bounds on the Steiner radius of a graph.
Discret. Math. Algorithms Appl., October, 2023

The dominant edge metric dimension of graphs.
Electron. J. Graph Theory Appl., 2023

The dominating partition dimension and locating-chromatic number of graphs.
Electron. J. Graph Theory Appl., 2023

On Ramsey (C4, K1, n)-minimal graphs.
Electron. J. Graph Theory Appl., 2023

2022
On 2-power unicyclic cubic graphs.
Electron. J. Graph Theory Appl., 2022

Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star.
Electron. J. Graph Theory Appl., 2022

Multipartite Ramsey Numbers of Union of Stars.
Electron. J. Graph Theory Appl., 2022

2021
Improved algorithm for the locating-chromatic number of trees.
Theor. Comput. Sci., 2021

Determining finite connected graphs along the quadratic embedding constants of paths.
Electron. J. Graph Theory Appl., 2021

2020
Calculating an upper bound of the locating-chromatic number of trees.
Theor. Comput. Sci., 2020

Total vertex irregularity strength for trees with many vertices of degree two.
Electron. J. Graph Theory Appl., 2020

On the restricted size Ramsey number for P3 versus dense connected graphs.
Electron. J. Graph Theory Appl., 2020

2019
A method to construct graphs with certain partition dimension.
Electron. J. Graph Theory Appl., 2019

The connected size Ramsey number for matchings versus small disconnected graphs.
Electron. J. Graph Theory Appl., 2019

On the restricted size Ramsey number involving a path <i>P<sub>3</sub></i>.
Discuss. Math. Graph Theory, 2019

2018
Total vertex irregularity strength of trees with maximum degree five.
Electron. J. Graph Theory Appl., 2018

On Ramsey (4K2, P3)-minimal graphs.
AKCE Int. J. Graphs Comb., 2018

2017
On Ramsey (mK<sub>2</sub>,H)-Minimal Graphs.
Graphs Comb., 2017

Restricted size Ramsey number for path of order three versus graph of order five.
Electron. J. Graph Theory Appl., 2017

On size multipartite Ramsey numbers for stars versus paths and cycles.
Electron. J. Graph Theory Appl., 2017

2016
Size multipartite Ramsey numbers for stripes versus small cycles.
Electron. J. Graph Theory Appl., 2016

2015
Matching-Star Ramsey Minimal Graphs.
Math. Comput. Sci., 2015

The complete list of Ramsey (2K<sub>2</sub>, K<sub>4</sub>)-minimal graphs.
Electron. J. Graph Theory Appl., 2015

On energy, Laplacian energy and p-fold graphs.
Electron. J. Graph Theory Appl., 2015

On the Ramsey Numbers R(S<sub>2, m</sub>, K<sub>2, q</sub>) and R(sK<sub>2</sub>, K<sub>s</sub>+C<sub>n</sub>).
Ars Comb., 2015

On total irregularity strength of generalized Halin graph.
Ars Comb., 2015

On Unicyclic Ramsey (mK2, P<sub>3</sub>)-Minimal Graphs.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

On Locating-chromatic Number for Graphs with Dominant Vertices.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Locating-Chromatic Number of Binary Trees.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Total Vertex-Irregularity Labelings for Subdivision of Several Classes of Trees.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Algorithm to Construct Graph with Total Vertex Irregularity Strength Two.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

On The Restricted Size Ramsey Number.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

On Ramsey Minimal Graphs for the Pair Paths.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Connected Size Ramsey Numbers for Matchings versus Cycles or Paths.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Bounds on the Locating-Chromatic Number for a Subdivision of a Graph on One Edge.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

On Size Multipartite Ramsey Numbers for Stars versus Cycles.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Partition Dimension of Some Classes of Homogenous Disconnected Graphs.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Partition Dimension of Some Families of Trees.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Partition Dimension of Some Classes of Trees.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Partition Dimension of a Subdivision of a Complete Graph.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Graphs with certain locating-chromatic number.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
On the super edge-magic deficiency of a star forest.
Ars Comb., 2014

2013
Characterizing all trees with locating-chromatic number 3.
Electron. J. Graph Theory Appl., 2013

The metric dimension of the lexicographic product of graphs.
Discret. Math., 2013

Supermagic coverings of the disjoint union of graphs and amalgamations.
Discret. Math., 2013

Construction Techniques for Digraphs with Minimum Diameter.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
Total vertex irregularity strength of disjoint union of Helm graphs.
Discuss. Math. Graph Theory, 2012

On super antimagic total labeling of Harary graph.
Ars Comb., 2012

2011
Large bipartite Cayley graphs of given degree and diameter.
Discret. Math., 2011

Magic graphs with pendant edges.
Ars Comb., 2011

Comparison of PUMA and CUNWRAP to 2-D phase unwrapping.
Proceedings of the International Conference on Electrical Engineering and Informatics, 2011

On graph of order-n with the metric dimension n-3.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
On Ramsey <i>(K<sub>1, 2</sub>, C<sub>4</sub>)</i>-minimal graphs.
Discuss. Math. Graph Theory, 2010

On the total vertex irregularity strength of trees.
Discret. Math., 2010

2009
An Expansion Technique on Super Edge-Magic Total Graphs.
Ars Comb., 2009

2008
The Ramsey Numbers of Large cycles Versus Odd Wheels.
Graphs Comb., 2008

The Ramsey numbers for disjoint unions of graphs.
Discret. Math., 2008

Enumerations of vertex orders of almost Moore digraphs with selfrepeats.
Discret. Math., 2008

On the super edge-magic deficiencies of graphs.
Australas. J Comb., 2008

2007
On Super Edge-Magic Strength and Deficiency of Graphs.
Proceedings of the Computational Geometry and Graph Theory, 2007

Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle.
Proceedings of the Computational Geometry and Graph Theory, 2007

2006
The Ramsey numbers of large cycles versus wheels.
Discret. Math., 2006

The Ramsey numbers for disjoint unions of trees.
Discret. Math., 2006

2005
Complete characterization of almost Moore digraphs of degree three.
J. Graph Theory, 2005

The Ramsey number of paths with respect to wheels.
Discret. Math., 2005

2003
Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs.
J. Autom. Lang. Comb., 2003

An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Some Conditions for the Existence of ( <i>d</i>, <i>k</i>)-Digraphs.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Antimagic Valuations for the Special Class of Plane Graphs.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002
On Ramsey Numbers for Trees Versus Wheels of Five or Six Vertices.
Graphs Comb., 2002

2000
Further results on almost Moore digraphs.
Ars Comb., 2000

Edge-magic total labelings.
Australas. J Comb., 2000

1998
On the Structure of Digraphs with Order Close to the Moore Bound.
Graphs Comb., 1998

1995
Digraphs of degree 3 and order close to the moore bound.
J. Graph Theory, 1995

Regular digraphs of diamter 2 and maximum order: Corrigenda.
Australas. J Comb., 1995

1994
Regular digraphs of diameter 2 and maximum order.
Australas. J Comb., 1994


  Loading...