2024
Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes.
J. Appl. Math. Comput., June, 2024
A Post-Quantum Compliant Authentication Scheme for IoT Healthcare Systems.
IEEE Internet Things J., February, 2024
2023
On the structure of matroids arising from the gain graphs.
Discret. Math., December, 2023
2022
GHWs of codes derived from the incidence matrices of some graphs.
Comput. Appl. Math., June, 2022
On the double Roman bondage numbers of graphs.
Discret. Math. Algorithms Appl., 2022
Unitary Cayley graphs whose Roman domination numbers are at most four.
AKCE Int. J. Graphs Comb., 2022
2021
Further results on the signed Italian domination.
J. Appl. Math. Comput., June, 2021
The general position problem on Kneser graphs and on some graph operations.
Discuss. Math. Graph Theory, 2021
On the Roman {2}-domatic number of graphs.
Discret. Math. Algorithms Appl., 2021
Some algebraic properties of Sierpiński-type graphs.
Ars Math. Contemp., 2021
2020
Zero-sum flows for Steiner systems.
Discret. Math., 2020
On sign-symmetric signed graphs.
Ars Math. Contemp., 2020
The watching system as a generalization of identifying code.
Appl. Math. Comput., 2020
Independent double Roman domination in graphs.
AKCE Int. J. Graphs Comb., 2020
2019
Lightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives.
ISC Int. J. Inf. Secur., 2019
Nowhere-zero flow on some products of signed graphs.
Discret. Appl. Math., 2019
On the signed Italian domination of graphs.
Comput. Sci. J. Moldova, 2019
2018
A note on the Ramsey number of even wheels versus stars.
Discuss. Math. Graph Theory, 2018
2017
On double-star decomposition of graphs.
Discuss. Math. Graph Theory, 2017
Identifying codes and watching systems in Kneser graphs.
Discret. Math. Algorithms Appl., 2017
Star-critical Ramsey number of F<sub>n</sub> versus K<sub>4</sub>.
Discret. Appl. Math., 2017
Dynamical 2-domination in Graphs.
Ars Comb., 2017
2016
Cryptographic Properties of Addition Modulo 2<sup>n</sup>.
IACR Cryptol. ePrint Arch., 2016
The annihilating-ideal graph of ℤ<sub>n</sub> is weakly perfect.
Contributions Discret. Math., 2016
Proper Nearly Perfect Sets in Graphs.
Ars Comb., 2016
2015
Statistical Properties of Multiplication mod 2<sup>n</sup>.
IACR Cryptol. ePrint Arch., 2015
2014
Construction of New Families of MDS Diffusion Layers.
IACR Cryptol. ePrint Arch., 2014
Dominating Sets of the Annihilating-Ideal Graphs.
Electron. Notes Discret. Math., 2014
New concepts in design of lightweight MDS diffusion layers.
Proceedings of the 11th International ISC Conference on Information Security and Cryptology, 2014
2012
On the diameter and girth of zero-divisor graphs of posets.
Discret. Appl. Math., 2012
2008
A New Technique For Constructing Pairwise Balanced Designs From Groups.
Ars Comb., 2008
2006
3-Designs from PSL(2, q).
Discret. Math., 2006
2004
An Algorithm for Constructing two disjoint Hadamard Designs.
Ars Comb., 2004
2001
Minimal defining sets for full 2-(v, 3, v-2) designs.
Australas. J Comb., 2001
1999
Discret. Appl. Math., 1999
On 2-(v, 3) Steiner Trades of Small Volumes.
Ars Comb., 1999
Classification of simple 2-(6, 3) and 2-(7, 3) trades.
Australas. J Comb., 1999
1997
Smallest defining sets for 2-(10, 5, 4) designs.
Australas. J Comb., 1997