Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1010.5651

On bipartite graphs of defect at most 4

Ramiro Feria-Purón·Guillermo Pineda-Villavicencio
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the bipartite version of the degree/diameter problem, namely, given natural numbers Δ \geq 2 and D \geq 2, find the maximum number Nb(Δ,D) of vertices in a bipartite graph of maximum degree Δ and diameter D. In this context, the Moore bipartite bound Mb(Δ,D) represents an upper bound for Nb(Δ,D). Bipartite graphs of maximum degree Δ, diameter D and order Mb(Δ,D), called Moore bipartite graphs, have turned out to be very rare. Therefore, it is very interesting to investigate bipartite graphs of maximum degree Δ \geq 2, diameter D \geq 2 and order Mb(Δ,D) - εwith small ε> 0, that is, bipartite (Δ,D,-ε)-graphs. The parameter εis called the defect. This paper considers bipartite graphs of defect at most 4, and presents all the known such graphs. Bipartite graphs of defect 2 have been studied in the past; if Δ \geq 3 and D \geq 3, they may only exist for D = 3. However, when ε> 2 bipartite (Δ,D,-ε)-graphs represent a wide unexplored area. The main results of the paper include several necessary conditions for the existence of bipartite $(Δ,d,-4)$-graphs; the complete catalogue of bipartite (3,D,-ε)-graphs with D \geq 2 and 0 \leq ε\leq 4; the complete catalogue of bipartite (Δ,D,-ε)-graphs with Δ \geq 2, 5 \leq D \leq 187 (D /= 6) and 0 \leq ε\leq 4; and a non-existence proof of all bipartite (Δ,D,-4)-graphs with Δ \geq 3 and odd D \geq 7. Finally, we conjecture that there are no bipartite graphs of defect 4 for Δ \geq 3 and D \geq 5, and comment on some implications of our results for upper bounds of Nb(Δ,D).

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ramiro Feria-Purón, Guillermo Pineda-Villavicencio. 2011-06-07. On bipartite graphs of defect at most 4. https://doi.org/10.1016/j.dam.2011.09.002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗