Edy Tri Baskoro

Discret. Math. Algorithms Appl., October, 2023

The dominant edge metric dimension of graphs.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2023

The dominating partition dimension and locating-chromatic number of graphs.

[BibT_eX]

[DOI]

Muhammad Ridwan

Electron. J. Graph Theory Appl., 2023

On Ramsey (C4, K1, n)-minimal graphs.

[BibT_eX]

[DOI]

Maya Nabila

Electron. J. Graph Theory Appl., 2023

2022

On 2-power unicyclic cubic graphs.

[BibT_eX]

[DOI]

Shariefuddin Pirzada

Mushtaq Shah

Electron. J. Graph Theory Appl., 2022

Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star.

[BibT_eX]

[DOI]

Maya Nabila

Electron. J. Graph Theory Appl., 2022

Multipartite Ramsey Numbers of Union of Stars.

[BibT_eX]

[DOI]

I Wayan Palton Anuwiksa

Electron. J. Graph Theory Appl., 2022

2021

Improved algorithm for the locating-chromatic number of trees.

[BibT_eX]

[DOI]

Devi Imulia Dian Primaskun

Theor. Comput. Sci., 2021

Determining finite connected graphs along the quadratic embedding constants of paths.

[BibT_eX]

[DOI]

Nobuaki Obata

Electron. J. Graph Theory Appl., 2021

2020

Calculating an upper bound of the locating-chromatic number of trees.

[BibT_eX]

[DOI]

Dian Kastika Syofyan

Theor. Comput. Sci., 2020

Total vertex irregularity strength for trees with many vertices of degree two.

[BibT_eX]

[DOI]

Susilawati

Electron. J. Graph Theory Appl., 2020

On the restricted size Ramsey number for P3 versus dense connected graphs.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2020

2019

A method to construct graphs with certain partition dimension.

[BibT_eX]

[DOI]

Debi Oktia Haryeni

Suhadi Wido Saputro

Electron. J. Graph Theory Appl., 2019

The connected size Ramsey number for matchings versus small disconnected graphs.

[BibT_eX]

[DOI]

Budi Rahadjeng

Electron. J. Graph Theory Appl., 2019

On the restricted size Ramsey number involving a path P3.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2019

2018

Total vertex irregularity strength of trees with maximum degree five.

[BibT_eX]

[DOI]

Susilawati

Electron. J. Graph Theory Appl., 2018

On Ramsey (4K2, P3)-minimal graphs.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2018

2017

On Ramsey (mK2,H)-Minimal Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Restricted size Ramsey number for path of order three versus graph of order five.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2017

On size multipartite Ramsey numbers for stars versus paths and cycles.

[BibT_eX]

[DOI]

Anie Lusiani

Suhadi Wido Saputro

Electron. J. Graph Theory Appl., 2017

2016

Size multipartite Ramsey numbers for stripes versus small cycles.

[BibT_eX]

[DOI]

Chula J. Jayawardene

Lilanthi Samarasekara

Syafrizal Sy

Electron. J. Graph Theory Appl., 2016

2015

Matching-Star Ramsey Minimal Graphs.

[BibT_eX]

[DOI]

Hadi Muhshi

Math. Comput. Sci., 2015

The complete list of Ramsey (2K2, K4)-minimal graphs.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2015

On energy, Laplacian energy and p-fold graphs.

[BibT_eX]

[DOI]

Hilal A. Ganie

Shariefuddin Pirzada

Electron. J. Graph Theory Appl., 2015

On the Ramsey Numbers R(S2, m, K2, q) and R(sK2, Ks+Cn).

[BibT_eX]

Ars Comb., 2015

On total irregularity strength of generalized Halin graph.

[BibT_eX]

Ali Ahmad

Nurdin

Ars Comb., 2015

On Unicyclic Ramsey (mK2, P3)-Minimal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

On Locating-chromatic Number for Graphs with Dominant Vertices.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Locating-Chromatic Number of Binary Trees.

[BibT_eX]

[DOI]

Dian Kastika Syofyan

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Total Vertex-Irregularity Labelings for Subdivision of Several Classes of Trees.

[BibT_eX]

[DOI]

Susilawati

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Algorithm to Construct Graph with Total Vertex Irregularity Strength Two.

[BibT_eX]

[DOI]

Hikmatiarahmah Kekaleniate

Siti Lutpiah

Kiki Ariyanti Sugeng

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

On The Restricted Size Ramsey Number.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

On Ramsey Minimal Graphs for the Pair Paths.

[BibT_eX]

[DOI]

Desi Rahmadani

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Connected Size Ramsey Numbers for Matchings versus Cycles or Paths.

[BibT_eX]

[DOI]

Budi Rahadjeng

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.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

On Size Multipartite Ramsey Numbers for Stars versus Cycles.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Partition Dimension of Some Classes of Homogenous Disconnected Graphs.

[BibT_eX]

[DOI]

Debi Oktia Haryeni

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Partition Dimension of Some Families of Trees.

[BibT_eX]

[DOI]

Ketut Queena Fredlina

K. Ida Bagus Kade Puja Arimbawa

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Partition Dimension of Some Classes of Trees.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Partition Dimension of a Subdivision of a Complete Graph.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Graphs with certain locating-chromatic number.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

On the super edge-magic deficiency of a star forest.

[BibT_eX]

Abdul Qudair Baig

Andrea Semanicová-Fenovcíková

Ars Comb., 2014

2013

Characterizing all trees with locating-chromatic number 3.

[BibT_eX]

[DOI]

Asmiati

Electron. J. Graph Theory Appl., 2013

The metric dimension of the lexicographic product of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

Supermagic coverings of the disjoint union of graphs and amalgamations.

[BibT_eX]

[DOI]

Tita Khalis Maryati

A. N. M. Salman

Discret. Math., 2013

Construction Techniques for Digraphs with Minimum Diameter.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

Total vertex irregularity strength of disjoint union of Helm graphs.

[BibT_eX]

[DOI]

Ali Ahmad

Muhammad Imran

Discuss. Math. Graph Theory, 2012

On super antimagic total labeling of Harary graph.

[BibT_eX]

Muhammad Hussain

Kashif Ali

Ars Comb., 2012

2011

Large bipartite Cayley graphs of given degree and diameter.

[BibT_eX]

[DOI]

Tomás Vetrík

Discret. Math., 2011

Magic graphs with pendant edges.

[BibT_eX]

Ngurah Anak Agung Gede

Ioan Tomescu

Ars Comb., 2011

Comparison of PUMA and CUNWRAP to 2-D phase unwrapping.

[BibT_eX]

[DOI]

Nurjannah Syakrani

Tati L. R. Mengko

Andriyan Bayu Suksmono

Proceedings of the International Conference on Electrical Engineering and Informatics, 2011

On graph of order-n with the metric dimension n-3.

[BibT_eX]

[DOI]

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

On Ramsey (K1, 2, C4)-minimal graphs.

[BibT_eX]

[DOI]

Tomás Vetrík

Lyra Yulianti

Discuss. Math. Graph Theory, 2010

On the total vertex irregularity strength of trees.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

An Expansion Technique on Super Edge-Magic Total Graphs.

[BibT_eX]

Ars Comb., 2009

2008

The Ramsey Numbers of Large cycles Versus Odd Wheels.

[BibT_eX]

[DOI]

Surahmat

Ioan Tomescu

Graphs Comb., 2008

The Ramsey numbers for disjoint unions of graphs.

[BibT_eX]

[DOI]

Hasmawati

Discret. Math., 2008

Enumerations of vertex orders of almost Moore digraphs with selfrepeats.

[BibT_eX]

[DOI]

Yus Mochamad Cholily

Discret. Math., 2008

On the super edge-magic deficiencies of graphs.

[BibT_eX]

[DOI]

Ngurah Anak Agung Gede

Australas. J Comb., 2008

2007

On Super Edge-Magic Strength and Deficiency of Graphs.

[BibT_eX]

[DOI]

Ngurah Anak Agung Gede

Proceedings of the Computational Geometry and Graph Theory, 2007

Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry and Graph Theory, 2007

2006

The Ramsey numbers of large cycles versus wheels.

[BibT_eX]

[DOI]

Surahmat

Ioan Tomescu

Discret. Math., 2006

The Ramsey numbers for disjoint unions of trees.

[BibT_eX]

[DOI]

Hasmawati

Discret. Math., 2006

2005

Complete characterization of almost Moore digraphs of degree three.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

The Ramsey number of paths with respect to wheels.

[BibT_eX]

[DOI]

Surahmat

Discret. Math., 2005

2003

Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs.

[BibT_eX]

[DOI]

A. N. M. Salman

Hajo Broersma

J. Autom. Lang. Comb., 2003

An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Some Conditions for the Existence of ( d, k)-Digraphs.

[BibT_eX]

[DOI]

Yus Mochamad Cholily

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Antimagic Valuations for the Special Class of Plane Graphs.

[BibT_eX]

[DOI]

Martin Baca

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002

On Ramsey Numbers for Trees Versus Wheels of Five or Six Vertices.

[BibT_eX]

[DOI]

Graphs Comb., 2002

2000

Further results on almost Moore digraphs.

[BibT_eX]

Ján Plesník

Ars Comb., 2000

Edge-magic total labelings.

[BibT_eX]

[DOI]

Australas. J Comb., 2000

1998

On the Structure of Digraphs with Order Close to the Moore Bound.

[BibT_eX]

[DOI]