I Nengah Suparta

Orcid: 0000-0002-7282-1540

According to our database1, I Nengah Suparta authored at least 11 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Modular irregularity strength of dense graphs.
Electron. J. Graph Theory Appl., 2024

2023
Mapping of Mobile Learning Research Directions and Trends in Scopus-Indexed Journals: A Bibliometric Analysis.
Int. J. Interact. Mob. Technol., February, 2023

2022
On face irregular evaluations of plane graphs.
Discuss. Math. Graph Theory, 2022

2020
Expanding graceful trees.
Electron. J. Graph Theory Appl., 2020

2017
Some classes of bipartite graphs induced by Gray codes.
Electron. J. Graph Theory Appl., 2017

2008
A construction of Gray codes inducing complete graphs.
Discret. Math., 2008

2006
Counting sequences, Gray codes and lexicodes.
PhD thesis, 2006

Balanced Maximum Counting Sequences.
IEEE Trans. Inf. Theory, 2006

2005
On the Construction of Linear <i>q</i>-ary Lexicodes.
Des. Codes Cryptogr., 2005

A Simple Proof for the Existence of Exponentially Balanced Gray Codes.
Electron. J. Comb., 2005

2003
The separability of standard cyclic N-ary Gray codes.
IEEE Trans. Inf. Theory, 2003


  Loading...