๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the largest eigenvalues of bipartite graphs which are nearly complete

โœ Scribed by Yi-Fan Chen; Hung-Lin Fu; In-Jae Kim; Eryn Stehr; Brendon Watts

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
154 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Pagenumber of Complete Bipartite
On the Pagenumber of Complete Bipartite Graphs
โœ Hikoe Enomoto; Tomoki Nakamigawa; Katsuhiro Ota ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 324 KB

The pagenumber p(G) of a graph G is defined as the smallest n such that G can be embedded in a book with n pages. We give an upper bound for the pagenumber of the complete bipartite graph K m, n . Among other things, we prove p(K n, n ) w2nร‚3x+1 and p(K wn 2 ร‚4x, n ) n&1. We also give an asymptotic

On the second largest eigenvalue of line
On the second largest eigenvalue of line graphs
โœ Petrovi?, Miroslav; Mileki?, Bojana ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 169 KB ๐Ÿ‘ 2 views

In this paper all connected line graphs whose second largest eigenvalue does not exceed 1 are characterized. Besides, all minimal line graphs with second largest eigenvalue greater than 1 are determined.

On the decomposition of kn into complete
On the decomposition of kn into complete bipartite graphs
โœ H. Tverberg ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 76 KB ๐Ÿ‘ 1 views

## Abstract A short proof is given of the impossibility of decomposing the complete graph on __n__ vertices into __n__โ€2 or fewer complete bipartite graphs.