q - regular bipartite graphs
نویسنده
چکیده
An explicit construction of a family of binary LDPC codes called LU(3, q), where q is a power of a prime, was recently given. A conjecture was made for the dimensions of these codes when q is odd. The conjecture is proved in this note. The proof involves the geometry of a 4-dimensional symplectic vector space and the action of the symplectic group and its subgroups.
منابع مشابه
A construction of small regular bipartite graphs of girth 8
Let q be a prime a power and k an integer such that 3 ≤ k ≤ q. In this paper we present a method using Latin squares to construct adjacency matrices of k-regular bipartite graphs of girth 8 on 2(kq − q) vertices. Some of these graphs have the smallest number of vertices among the known regular graphs with girth 8.
متن کاملConstructions of small regular bipartite graphs of girth 6
In this article, some structures in the projective plane of order q are found which allow us to construct small k regular balanced bipartite graphs of girth 6 for all k ≤ q . When k = q , the order of these q-regular graphs is 2(q2−1); andwhen k ≤ q−1, the order of these k -regular graphs is 2(qk − 2). Moreover, the incidence matrix of a k -regular balanced bipartite graph of girth 6 having 2(q...
متن کاملOn Bipartite Q-Polynomial Distance-Regular Graphs with Diameter 9, 10, or 11
Let Γ denote a bipartite distance-regular graph with diameter D. In [J. S. Caughman, Bipartite Q-polynomial distance-regular graphs, Graphs Combin. 20 (2004), 47–57], Caughman showed that if D > 12, then Γ is Q-polynomial if and only if one of the following (i)-(iv) holds: (i) Γ is the ordinary 2D-cycle, (ii) Γ is the Hamming cube H(D, 2), (iii) Γ is the antipodal quotient of the Hamming cube H...
متن کاملIncidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices
Let q be a prime power and r = 0, 1 . . . , q − 3. Using the Latin squares obtained by multiplying each entry of the addition table of the Galois field of order q by an element distinct from zero, we obtain the incidence matrices of projective planes and the incidence matrices of (q− r)-regular bipartite graphs of girth 6 and q − rq− 1 vertices in each partite set. Moreover, in this work two La...
متن کاملNew Examples of Graphs without Small Cycles and of Large Size
For any prime power q ≥ 3, we consider two infinite series of bipartite q–regular edge–transitive graphs of orders 2q and 2q which are induced subgraphs of regular generalized 4–gon and 6–gon, respectively. We compare these two series with two families of graphs,H3(p) andH5(p), p is a prime, constructed recently by Wenger ([26]), which are new examples of extremal graphs without 6– and 10–cycle...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کامل