Somayyeh Golalizadeh

According to our database, Somayyeh Golalizadeh authored at least 6 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

On the codewords of generalized Reed-Muller codes reaching the fourth weight.

Somayyeh Golalizadeh, Nasrin Soltankhah

Inf. Comput., January, 2024

2023

On the fourth weight of generalized Reed-Muller codes.

Somayyeh Golalizadeh, Nasrin Soltankhah

Des. Codes Cryptogr., December, 2023

2019

On the Existence of d-Homogeneous $$\mu $$ μ -Way (v, 3, 2) Steiner Trades.

Somayyeh Golalizadeh, Nasrin Soltankhah

Graphs Comb., 2019

2016

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

2012

Sharp bounds for the number of matchings in generalized-theta-graphs.

Ardeshir Dolati, Somayyeh Golalizadeh

Discuss. Math. Graph Theory, 2012

The Tight Upper Bound for the Number of Matchings of Tricyclic Graphs.

Ardeshir Dolati, Somayyeh Golalizadeh

Electron. J. Comb., 2012