𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bipartite Graphs and their Degree Sets

✍ Scribed by Y. Manoussakis; H.P. Patil

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
69 KB
Volume
15
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximal independent sets in bipartite gr
Maximal independent sets in bipartite graphs
✍ Jiuqiang Liu πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 458 KB πŸ‘ 1 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G.__ In this paper, we determine the maximum number of maximal independent sets among all bipartite graphs of order __n__ and the extremal graphs as well as

Large bipartite graphs with given degree
Large bipartite graphs with given degree and diameter
✍ C. Delorme πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 393 KB πŸ‘ 1 views

W e give constructions of bipartite graphs with maximum A, diameter D on B vertices. such :bat for every D 3 2 :he !im i nf , . . , B . A'"' = b,, > 0. W e also improve similar results on ordinary graphs, for example, w e prove that lim, , , N -A-." = 1 if D is 3 or 5. This is a partial answer to a

Bipartite graphs and their endomorphism
Bipartite graphs and their endomorphism monoids
✍ Fan, Suohai πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 231 KB

It is shown that any connected bipartite graph is determined by its endomorphism monoid up to isomorphism.

Decomposition of bipartite graphs under
Decomposition of bipartite graphs under degree constraints
✍ H. J. Broersma; R. J. Faudree; J. Den Van Heuvel; H. J. Veldman πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 339 KB

## Abstract Let __G__ = __(A, B; E)__ be a bipartite graph. Let __e__~1~, __e__~2~ be nonnegative integers, and __f__~1~, __f__~2~ nonnegative integer‐valued functions on __V(G)__ such that __e__~__i__~ ≦ |__E__| ≦ __e__~1~ + __e__~2~ and __f~i~(v)__ ≦ __d(v)__ ≦ __f__~1~__(v)__ + __f__~2~__(v)__ f

Minimum degree thresholds for bipartite
Minimum degree thresholds for bipartite graph tiling
✍ Albert Bush; Yi Zhao πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 361 KB

## Abstract Given a bipartite graph __H__ and a positive integer __n__ such that __v__(__H__) divides 2__n__, we define the minimum degree threshold for bipartite __H__‐tiling, Ξ΄~2~(__n, H__), as the smallest integer __k__ such that every bipartite graph __G__ with __n__ vertices in each partition