An Expansion Technique on Super Edge-Magic Total Graphs. - I Wayan Sudarsana; Edy Tri Baskoro; Saladin Uttunggadewa; D. Ismaimuza (Ars Comb., 2009)

The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs. - I Wayan Sudarsana; Adiwijaya; Selvy Musdalifah (COCOON, 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)

On the Ramsey Numbers R(S2, m, K2, q) and R(sK2, Ks+Cn). - I Wayan Sudarsana; Hilda Assiyatun; Saladin Uttunggadewa; Edy Tri Baskoro (Ars Comb., 2015)

The goodness of path or cycle with respect to multiple copies of complete graphs of order three. - I Wayan Sudarsana (Ars Comb., 2016)

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)

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)

A note on the Ramsey number for cycle with respect to multiple copies of wheels. - I Wayan Sudarsana (Electron. J. Graph Theory Appl., 2021)

The locating chromatic number for m-shadow of a connected graph. - I Wayan Sudarsana; Faisal Susanto; Selvy Musdalifah (Electron. J. Graph Theory Appl., 2022)

Non-inclusive and inclusive distance irregularity strength for the join product of graphs. - Faisal Susanto; Kristiana Wijaya; I Wayan Sudarsana; S. Slamin 001 (Electron. J. Graph Theory Appl., 2022)