The Diameter of a Cycle Plus a Random Matching, SIAM Journal on Discrete Mathematics, vol.1, issue.3, pp.328-333, 1966. ,
DOI : 10.1137/0401033
New large bipartite graphs with given degree and diameter, Ars Combinatorica, vol.25, pp.123-132, 1988. ,
Algebraic Graph Theory. Cambridge Mathematical Library, 1993. ,
Constructions for cubic graphs with large girth, Electron. J. Combin, vol.5, issue.1, 1998. ,
The diameter of random regular graphs, Combinatorica, vol.12, issue.2, pp.125-134, 1982. ,
DOI : 10.1007/BF02579310
Large bipartite graphs with given degree and diameter, J. Graph Theory, vol.8, pp.325-333, 1985. ,
New results for the degree/diameter problem, Networks, vol.19, issue.38, pp.359-367, 1994. ,
DOI : 10.1002/net.3230240702
Large Cayley graphs and digraphs with small degree and diameter, Computational Algebra and Number Theory. Mathematics and Its Applications, pp.291-302, 1995. ,
Graphical Enumeration, 1973. ,
Families of Fixed Degree Graphs for Processor Interconnection, IEEE Transactions on Computers, vol.33, issue.2, pp.190-194, 1984. ,
DOI : 10.1109/TC.1984.1676410
Some large trivalent graphs having small diameter, Disc. Appl. Math, vol.3738, pp.353-357, 1992. ,
Kombinatorische Anzahlbestimmungen f??r Gruppen, Graphen und chemische Verbindungen, Acta Mathematica, vol.68, issue.0, pp.145-253, 1937. ,
DOI : 10.1007/BF02546665
Enumeration under two representations of the wreath product, Acta Mathematica, vol.131, issue.0, pp.123-143, 1973. ,
DOI : 10.1007/BF02392038
Cubic symmetric graphs (The Foster census), 2001. ,
The Mathematica Book, 1999. ,