Abstract
The Moore bipartite bound represents an upper bound on the order of a bipartite graph of maximum degree Δ and diameter D. Bipartite graphs of maximum degree Δ, diameter D and order equal to the Moore bipartite bound are called Moore bipartite graphs. Such bipartite graphs exist only if D=2,3,4 and 6, and for D=3,4,6, they have been constructed only for those values of Δ such that Δ−1 is a prime power.
The scarcity of Moore bipartite graphs, together with the applications of such large topologies in the design of interconnection networks, prompted us to investigate what happens when the order of bipartite graphs misses the Moore bipartite bound by a small number of vertices. In this direction the first class of graphs to be studied is naturally the class of bipartite graphs of maximum degree Δ, diameter D, and two vertices less than the Moore bipartite bound (defect 2), that is, bipartite (Δ,D,−2)-graphs.
For Δ≥3 bipartite (Δ,2,−2)-graphs are the complete bipartite graphs with partite sets of orders Δ and Δ−2. In this paper we consider bipartite (Δ,D,−2)-graphs for Δ≥3 and D≥3. Some necessary conditions for the existence of bipartite (Δ,3,−2)-graphs for Δ≥3 are already known, as well as the non-existence of bipartite (Δ,D,−2)-graphs with Δ≥3 and D=4,5,6,8. Furthermore, it had been conjectured that bipartite (Δ,D,−2)-graphs for Δ≥3 and D≥4 do not exist. Here, using graph spectra techniques, we completely settle this conjecture by proving the non-existence of bipartite (Δ,D,−2)-graphs for all Δ≥3 and all D≥6.
Article PDF
Similar content being viewed by others
References
Bannai, E., Ito, T.: On finite Moore graphs. J. Math. Sci., Univ. Tokyo 20, 191–208 (1973)
Bannai, E., Ito, T.: Regular graphs with excess one. Discrete Math. 37, 147–158 (1981). doi:10.1016/0012-365X(81)90215-6
Benson, C.T.: Minimal regular graphs of girth eight and twelve. Can. J. Math. 18, 1091–1094 (1966)
Biggs, N.L.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993)
Biggs, N.L., Ito, T.: Graphs with even girth and small excess. Math. Proc. Camb. Philos. Soc. 88(1), 1–10 (1980)
Dally, W.J., Towles, B.P.: Principles and Practices of Interconnection Networks. Morgan Kaufmann, San Francisco (2004)
Delorme, C., Jørgensen, L.K., Miller, M., Pineda-Villavicencio, G.: On bipartite graphs of defect 2. Eur. J. Comb. 30(4), 798–808 (2009)
Delorme, C., Jørgensen, L.K., Miller, M., Pineda-Villavicencio, G.: On bipartite graphs of diameter 3 and defect 2. J. Graph Theory 61(4), 271–288 (2009)
Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann, San Francisco (2003). Revised printing ed.
Feit, W., Higman, G.: The nonexistence of certain generalized polygons. J. Algebra 1, 114–131 (1964). doi:10.1016/0021-8693(64)90028-6
Godsil, C.D., McKay, B.D.: Feasibility conditions for the existence of walk-regular graphs. Linear Algebra Appl. 30, 51–61 (1980)
Heydemann, M.C.: Cayley graphs and interconnection networks. In: Graph Symmetry: Algebraic Methods and Applications. NATO ASI Series, Series C: Mathematical and Physical Sciences, vol. 497. Kluwer Academic, Dordrecht (1996)
Jørgensen, L.K.: Nonexistence of certain cubic graphs with small diameters. Discrete Math. 114, 265–273 (1993). doi:10.1016/0012-365X(93)90371-Y
Lidl, R., Mullen, G.L., Turnwald, G.: Dickson Polynomials. Pitman Monographs and Surveys in Pure and Applied Mathematics, vol. 65. Logman, London (1993)
Miller, M., Širáň, J.: Moore graphs and beyond: A survey of the degree/diameter problem. Electron. J. Comb. 1–61 (2005). Dynamic survey DS14
Pineda-Villavicencio, G.: Topology of interconnection networks with given degree and diameter. PhD Thesis, School of Information Technology and Mathematical Sciences, University of Ballarat, Ballarat, Australia, Dec 2009. http://guillermo.com.au/pdfs/GPVPhDThesis.pdf
Singleton, R.C.: On minimal graphs of maximum even girth. J. Comb. Theory 1(3), 306–332 (1966). doi:10.1016/S0021-9800(66)80054-6
Wolfram, S.: The Mathematica Book, 4th edn. Cambridge University Press, London (1999)
Xu, J.: Topological Structure and Analysis of Interconnection Networks. Network Theory and Applications, vol. 7. Kluwer Academic, Dordrecht (2001)
Xu, J.: Theory and Application of Graphs. Network Theory and Applications, vol. 10. Kluwer Academic, Dordrecht (2003)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pineda-Villavicencio, G. Non-existence of bipartite graphs of diameter at least 4 and defect 2. J Algebr Comb 34, 163–182 (2011). https://doi.org/10.1007/s10801-010-0266-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10801-010-0266-0