𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on minimal order of a bipartite graph with exactly q quadrilaterals

✍ Scribed by Mariusz Woźniak

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
206 KB
Volume
121
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

note on minimal order of a bipartite graph with exactly 4 quadrilaterals, Discrete Mathematics 121 (1993) 229-233.

We show that the minimal order of a bipartite graph having exactly 4 quadrilaterals is asymptotically equal to 2fl $j (as 4 tends to infinity).

📜 SIMILAR VOLUMES

A note on bipartite subgraphs of triangl
A note on bipartite subgraphs of triangle-free regular graphs
✍ S. C. Locke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

A lower bound on the order of regular gr
A lower bound on the order of regular graphs with given girth pair
✍ C. Balbuena; T. Jiang; Y. Lin; X. Marcote; M. Miller 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair was proved by Harary and Kovács [Regular graphs with given girth pair, J Graph Theory 7 (1983), 209–218]. A (δ, __g__)‐cage is a small

Note on the reconstruction of infinite g
Note on the reconstruction of infinite graphs with a fixed finite number of components
✍ Thomas Andreae 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 1 views

For every positive integer c , we construct a pair G, , H, of infinite, nonisomorphic graphs both having exactly c components such that G, and H, are hypomorphic, i.e., G, and H, have the same families of vertex-deleted subgraphs. This solves a problem of Bondy and Hemminger. Furthermore, the pair G