The Tight Upper Bound for the Number of Matchings of Tricyclic Graphs. - Ardeshir Dolati; Somayyeh Golalizadeh (Electron. J. Comb., 2012)

Sharp bounds for the number of matchings in generalized-theta-graphs. - Ardeshir Dolati; Somayyeh Golalizadeh (Discuss. Math. Graph Theory, 2012)

Super-simple (v, 4, 2) directed designs and a lower bound for the minimum size of their defining set. - M. Boostan; Somayyeh Golalizadeh; Nasrin Soltankhah (Discret. Appl. Math., 2016)

On the Existence of d-Homogeneous $$ mu $$ μ -Way (v, 3, 2) Steiner Trades. - Somayyeh Golalizadeh; Nasrin Soltankhah (Graphs Comb., 2019)

On the fourth weight of generalized Reed-Muller codes. - Somayyeh Golalizadeh; Nasrin Soltankhah (Des. Codes Cryptogr., 2023)

On the codewords of generalized Reed-Muller codes reaching the fourth weight. - Somayyeh Golalizadeh; Nasrin Soltankhah (Inf. Comput., 2024)