Gholamreza B. Khosrovshahi

Orcid: 0000-0001-7716-8459

According to our database1, Gholamreza B. Khosrovshahi authored at least 33 papers between 1981 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Maximal graphs with respect to rank.
Discret. Math., 2021

New partitionings of complete designs.
Des. Codes Cryptogr., 2021

2020
On the Volumes and Affine Types of Trades.
Electron. J. Comb., 2020

2014
More on the Wilson $W_{tk}(v)$ Matrices.
Electron. J. Comb., 2014

2013
On Optimality of Designs with Three Distinct Eigenvalues.
Electron. J. Comb., 2013

2012
A Note on Zero-Sum 5-Flows in Regular Graphs.
Electron. J. Comb., 2012

2009
Classification of simple 2-(11, 3, 3) designs.
Discret. Math., 2009

Preface.
Discret. Math., 2009

2008
Inclusion matrices and chains.
J. Comb. Theory, Ser. A, 2008

2006
Large sets of t-designs through partitionable sets: A survey.
Discret. Math., 2006

Preface.
Discret. Math., 2006

2005
On the nonexistence of Steiner t-(v, k) trades.
Ars Comb., 2005

2004
Some Indecomposable <i>t</i>-Designs.
Des. Codes Cryptogr., 2004

Enumeration of t-Designs Through Intersection Matrices.
Des. Codes Cryptogr., 2004

On the existence of trades of large volumes.
Ars Comb., 2004

Some New 4-Designs.
Ars Comb., 2004

2003
Root cases of large sets of <i>t</i>-designs.
Discret. Math., 2003

2002
On the smallest edge defining sets of graphs.
Ars Comb., 2002

2001
A New Proof of a Classical Theorem in Design Theory.
J. Comb. Theory, Ser. A, 2001

Some New 6-(14, 7, 4) Designs.
J. Comb. Theory, Ser. A, 2001

1999
Hypergraphical Codes Arising from Binary Trades.
Des. Codes Cryptogr., 1999

On Trades: An Update.
Discret. Appl. Math., 1999

Maximal Trades.
Ars Comb., 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
Trading Signed Designs and Some new 4-(12, 5, 4) Designs.
Des. Codes Cryptogr., 1997

Smallest defining sets for 2-(10, 5, 4) designs.
Australas. J Comb., 1997

1996
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP.
Networks, 1996

1994
More on halving the complete designs.
Discret. Math., 1994

1993
A Prospect for a General Method of Constructing <i>t</i>-Designs.
Discret. Appl. Math., 1993

1991
Combining <i>t</i>-designs.
J. Comb. Theory, Ser. A, 1991

1990
A New Basis for Trades.
SIAM J. Discret. Math., 1990

1981
An Algebraic Study of BIB Designs: a Complete Solution for v = 6 and k = 3.
J. Comb. Theory, Ser. A, 1981


  Loading...