On bipartite cages of excess 4

From MaRDI portal
(Redirected from Publication:521356)



Abstract: The Moore bound M(k,g) is a lower bound on the order of k-regular graphs of girth g (denoted (k,g)-graphs). The excess e of a (k,g)-graph of order n is the difference nM(k,g). In this paper we consider the existence of (k,g)-bipartite graphs of excess 4 via studying spectral properties of their adjacency matrices. We prove that the (k,g)-bipartite graphs of excess 4 satisfy the equation kJ=(A+kI)(Hd1(A)+E), where A denotes the adjacency matrix of the graph in question, J the nimesn all-ones matrix, E the adjacency matrix of a union of vertex-disjoint cycles, and Hd1(x) is the Dickson polynomial of the second kind with parameter k1 and of degree d1. We observe that the eigenvalues other than pmk of these graphs are roots of the polynomials Hd1(x)+lambda, where lambda is an eigenvalue of E. Based on the irreducibility of Hd1(x)pm2 we give necessary conditions for the existence of these graphs. If E is the adjacency matrix of a cycle of order n we call the corresponding graphs emph{graphs with cyclic excess}; if E is the adjacency matrix of a disjoint union of two cycles we call the corresponding graphs emph{graphs with bicyclic excess}. In this paper we prove the non-existence of (k,g)-graphs with cyclic excess 4 if kgeq6 and kequiv1!!pmod3, g=8,12,16 or kequiv2!!pmod3, g=8, and the non-existence of (k,g)-graphs with bicyclic excess 4 if kgeq7 is odd number and g=2d such that dgeq4 is even.











This page was built for publication: On bipartite cages of excess 4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521356)