𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bipartite Divisor Graphs for Integer Subsets

✍ Scribed by Mohammad A. Iranmanesh; Cheryl E. Praeger

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
251 KB
Volume
26
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bipartite subgraphs of integer weighted
Bipartite subgraphs of integer weighted graphs
✍ Noga Alon; Eran Halperin πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 411 KB

For every integer p > 0, let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large n and every m < n, f((~)+m)= LΒΌn2j +min (IΒ½nT,f(m)). This supplies the precise value of f(p) for many values of p includin

Minimizing makespan for a bipartite grap
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay
✍ Alix Munier Kordon πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 221 KB

We consider the makespan minimization for a unit execution time task sequencing problem with a bipartite precedence delays graph and a positive precedence delay d. We prove that the associated decision problem is strongly NP-complete and we provide a non-trivial polynomial sub-case. We also give an

Generating strings for bipartite Steinha
Generating strings for bipartite Steinhaus graphs
✍ Wayne M. Dymàček; Tom Whaley πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 473 KB

Let b(n) be the number of bipartite Steinhaus graphs with n vertices. We show that bin) satisfies the recurrence, b(2)=2, b(3)=4, and for k>~2, b(2k+ 1)=2b(k+ 1)+ 1, b(2k) = b(k) + b(k + 1). Thus b(n) <<, ~zn -~ with equality when n is one more than a power of two. To prove this recurrence, we descr

Rotation numers for complete bipartite g
Rotation numers for complete bipartite graphs
✍ Julie Haviland; Andrew Thomason πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 510 KB

## Abstract A __rooted graph__ is a pair (__G, x__) where __G__ is a simple undirected graph and __x__ Ο΅ __V__(__G__). If __G__ if rooted at __x__, then its __rotation number h(G, x)__ is teh minimum number of edges in a graph __F__, of the same order as __G__, such that for all __v__ Ο΅ __V(F)__ we