Æȷοì
Sudeep stephen
Sudeep stephen
uon.edu.auÀÇ À̸ÞÀÏ È®ÀεÊ
Á¦¸ñ
Àοë
Àοë
¿¬µµ
On certain topological indices of silicate, honeycomb and hexagonal networks
AW Bharati Rajan, C Grigorious, S Stephen
Journal of Computer and Mathematical Sciences Vol 3 (5), 498-556, 2012
1092012
A lower bound on the zero forcing number
R Davila, T Kalinowski, S Stephen
Discrete Applied Mathematics 250, 363-367, 2018
422018
On the partition dimension of a class of circulant graphs
C Grigorious, S Stephen, B Rajan, M Miller, A William
Information Processing Letters 114 (7), 353-356, 2014
362014
Power domination in certain chemical structures
S Stephen, B Rajan, J Ryan, C Grigorious, A William
Journal of discrete algorithms 33, 10-18, 2015
322015
On the metric dimension of circulant and Harary graphs
C Grigorious, P Manuel, M Miller, B Rajan, S Stephen
Applied Mathematics and Computation 248, 47-54, 2014
322014
Average distance in interconnection networks via reduction theorems for vertex-weighted graphs
S Klavžar, P Manuel, MJ Nadjafi-Arani, RS Rajan, C Grigorious, ...
The Computer Journal 59 (12), 1900-1910, 2016
292016
On the partition dimension of circulant graphs
C Grigorious, S Stephen, B Rajan, M Miller
The Computer Journal 60 (2), 180-184, 2017
242017
On certain networks with partition dimension three
AW Bharati Rajan, I Rajasingh, C Grigorious, S Stephen
Proceedings of the International Conference on Mathematics in Engineering ¡¦, 2012
192012
The metric dimension of the circulant graph
C Grigorious, T Kalinowski, J Ryan, S Stephen
arXiv preprint arXiv:1702.08178, 2017
162017
Resolving-power dominating sets
S Stephen, B Rajan, C Grigorious, A William
Applied Mathematics and Computation 256, 778-785, 2015
142015
Minimum rank and zero forcing number for butterfly networks
D Ferrero, C Grigorious, T Kalinowski, J Ryan, S Stephen
Journal of Combinatorial Optimization 37, 970-988, 2019
102019
Zero forcing in iterated line digraphs
D Ferrero, T Kalinowski, S Stephen
Discrete Applied Mathematics 255, 198-208, 2019
82019
On the power domination number of de Bruijn and Kautz digraphs
C Grigorious, T Kalinowski, S Stephen
International Workshop on Combinatorial Algorithms, 264-272, 2017
72017
On the strong metric dimension of tetrahedral diamond lattice
P Manuel, B Rajan, C Grigorious, S Stephen
Mathematics in Computer Science 9, 201-208, 2015
72015
Embedding wheel-like networks
RS Rajan, R Rajalaxmi, S Stephen, AA Shantrinal, KJ Kumar
Iranian Academic Center for Education, Culture and Research 18 (2), 185-198, 2023
52023
The zero forcing number of graphs with given girth
R Davila, T Kalinowski, S Stephen
arXiv preprint arXiv:1611.06557 22, 2016
52016
Comparative Study of C80 and B80 Fullerenes Based on Various Molecular Descriptors
S Stephen, C Grigorious, B Rajan, A William
Quantum Matter 3 (6), 505-509, 2014
52014
On Laplacian Energy of Certain Mesh Derived Networks
B Rajan, A William, S Stephen, C Grigorious
International Journal of Computer Applications 55 (11), 2012
52012
Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree
R Davila, T Kalinowski, S Stephen
arXiv preprint arXiv:1611.06557, 2016
42016
Automated Assessment: Experiences From the Trenches
A Luxton-Reilly, E Tempero, N Arachchilage, A Chang, P Denny, A Fowler, ...
Proceedings of the 25th Australasian Computing Education Conference, 1-10, 2023
32023
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–20