2 citations · 2 across the 4 of their papers we have counts for
4 papers
Determination of the size of defining set for Steiner triple systems
Nazli Besharati, M. Mortezaeefar
Every Steiner triple system is a uniform hypergraph. The coloring of hypergraph and its special case Steiner triple systems, {STS}, is studied extensively. But the defining se…
On the chromatic number of Latin square graphs
Nazli Besharati, Luis Goddyn, E. S. Mahmoodian +1
The chromatic number of a Latin square is the least number of partial transversals which cover its cells. This is just the chromatic number of its associated Latin square graph. Al…
Independence number of generalized Petersen graphs
Nazli Besharati, J. Ebrahimi B, A. Azadi
Determining the size of a maximum independent set of a graph , denoted by , is an NP-hard problem. Therefore, many attempts are made to find upper and lower bounds, or exa…
Silver block intersection graphs of Steiner 2-designs
A. Ahadi, Nazli Besharati, E. S. Mahmoodian +1
For a block design , a series of {\sf block intersection graphs} , or -{\rm BIG}(), is defined in which the vertices are the blocks of $\cal…