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!
| Publication | Date of Publication | Type |
|---|---|---|
| Some -labelings of chain with complete bipartite graph blocks Congressus Numerantium | 2026-08-27 | Paper |
| On odd-graceful coloring of graphs Communications in Combinatorics and Optimization | 2025-10-13 | Paper |
| Graceful chromatic number of some Cartesian product graphs Ural mathematical journal | 2024-07-17 | Paper |
| Modular irregularity strength of dense graphs Electronic Journal of Graph Theory and Applications | 2024-07-12 | Paper |
| On face irregular evaluations of plane graphs Discussiones Mathematicae Graph Theory | 2022-03-22 | Paper |
| Expanding graceful trees Electronic Journal of Graph Theory and Applications | 2021-09-06 | Paper |
| Some classes of bipartite graphs induced by Gray codes Electronic Journal of Graph Theory and Applications | 2021-08-16 | Paper |
| Balanced Maximum Counting Sequences IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| A construction of Gray codes inducing complete graphs Discrete Mathematics | 2008-09-04 | Paper |
| scientific article; zbMATH DE number 2239558 (Why is no real title available?) | 2005-12-19 | Paper |
| On the construction of linear \(q\)-ary lexicodes. Designs, Codes and Cryptography | 2005-11-07 | Paper |
| A simple proof for the existence of exponentially balanced Gray codes The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
| A simple proof for the existence of exponentially balanced Gray codes The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
| The separability of standard cyclic N-ary Gray codes IEEE Transactions on Information Theory | 2005-05-31 | Paper |
Research outcomes over time
This page was built for person: I. Nengah Suparta
