I Wayan Sudarsana

From MaRDI portal
(Redirected from Person:1652927)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The locating chromatic number for m-shadow of a connected graph
Electronic Journal of Graph Theory and Applications
2022-11-29Paper
Non-inclusive and inclusive distance irregularity strength for the join product of graphs
Electronic Journal of Graph Theory and Applications
2022-06-14Paper
A note on the Ramsey number for cycle with respect to multiple copies of wheels
Electronic Journal of Graph Theory and Applications
2022-03-14Paper
On \(H\)-supermagic labelings of \(m\)-shadow of paths and cycles
International Journal of Mathematics and Mathematical Sciences
2019-10-28Paper
On super mean labeling for total graph of path and cycle
International Journal of Mathematics and Mathematical Sciences
2018-07-17Paper
On the Ramsey number for cycle with respect to identical copies of complete graphs2017-02-17Paper
The goodness of path or cycle with respect to multiple copies of complete graphs of order three.
Ars Combinatoria
2016-10-26Paper
On the Ramsey numbers \(R(S_{2,m},K_{2,q})\) and \(R(sK_2,K_s+C_n)\).
Ars Combinatoria
2016-05-04Paper
The goodness of long path with respect to multiple copies of complete graphs
Journal of the Indonesian Mathematical Society
2015-12-11Paper
On super edge anti magic total labeling for \(t\)-joint copies of wheel2013-05-03Paper
The goodness of long path with respect to multiple copies of small wheel2013-04-19Paper
An expansion technique on super edge-magic total graphs2011-06-29Paper
On supermagic coverings of fans and ladders2011-05-31Paper
scientific article; zbMATH DE number 5872084 (Why is no real title available?)2011-03-30Paper
THE RAMSEY NUMBER FOR A LINEAR FOREST VERSUS TWO IDENTICAL COPIES OF COMPLETE GRAPHS
Discrete Mathematics, Algorithms and Applications
2011-03-25Paper
The Ramsey number for a linear forest versus two identical copies of complete graphs
Lecture Notes in Computer Science
2010-07-20Paper
Expansion techniques on the super edge antimagic total graphs2010-06-07Paper
scientific article; zbMATH DE number 5717254 (Why is no real title available?)2010-06-07Paper
scientific article; zbMATH DE number 5714321 (Why is no real title available?)2010-05-31Paper
On super \((a,d)\)-edge antimagic total labeling of disconnected graphs2006-09-14Paper
Creating new super edge-magic total labelings from old ones2006-09-14Paper
scientific article; zbMATH DE number 5000750 (Why is no real title available?)2006-01-23Paper


Research outcomes over time


This page was built for person: I Wayan Sudarsana