I Wayan Sudarsana

According to our database, I Wayan Sudarsana authored at least 10 papers between 2009 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Non-inclusive and inclusive distance irregularity strength for the join product of graphs.

Faisal Susanto, Kristiana Wijaya, I Wayan Sudarsana, S. Slamin

Electron. J. Graph Theory Appl., 2022

The locating chromatic number for m-shadow of a connected graph.

I Wayan Sudarsana, Faisal Susanto, Selvy Musdalifah

Electron. J. Graph Theory Appl., 2022

2021

A note on the Ramsey number for cycle with respect to multiple copies of wheels.

I Wayan Sudarsana

Electron. J. Graph Theory Appl., 2021

2019

On H-Supermagic Labelings of m-Shadow of Paths and Cycles.

Ika Hesti Agustin, Faisal Susanto, Dafik, Rafiantika M. Prihandini, Ridho Alfarisi, I Wayan Sudarsana

Int. J. Math. Math. Sci., 2019

2018

On Super Mean Labeling for Total Graph of Path and Cycle.

Nur Inayah, I Wayan Sudarsana, Selvy Musdalifah, Nurhasanah Daeng Mangesa

Int. J. Math. Math. Sci., 2018

2016

The goodness of path or cycle with respect to multiple copies of complete graphs of order three.

I Wayan Sudarsana

Ars Comb., 2016

2015

On the Ramsey Numbers R(S_{2, m}, K_{2, q}) and R(sK₂, K_s+C_n).

I Wayan Sudarsana, Hilda Assiyatun, Saladin Uttunggadewa, Edy Tri Baskoro

Ars Comb., 2015

2010

The Ramsey Number for a Linear Forest versus Two identical Copies of Complete Graphs.

I Wayan Sudarsana, Hilda Assiyatun, Adiwijaya, Selvy Musdalifah

Discret. Math. Algorithms Appl., 2010

The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs.

I Wayan Sudarsana, Adiwijaya, Selvy Musdalifah

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

An Expansion Technique on Super Edge-Magic Total Graphs.

I Wayan Sudarsana, Edy Tri Baskoro, Saladin Uttunggadewa, D. Ismaimuza

Ars Comb., 2009