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

Harper-type lower bounds and the bandwidths of the compositions of graphs

โœ Scribed by Sanming Zhou; Jinjiang Yuan

Book ID
108316140
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
541 KB
Volume
181
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sharp lower bounds of the least eigenval
Sharp lower bounds of the least eigenvalue of planar graphs
โœ Yuan Hong; Jin-Long Shu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 75 KB

Let G be a simple graph with n P 3 vertices and orientable genus g and non-orientable genus h. We deยฎne the Euler characteristic vq of a graph G by vq maxf2 ร€ 2gY 2 ร€ hg. Let kq be the least eigenvalue of the adjacency matrix A of G. In this paper, we obtain the following lower bounds of kq kq P ร€ 2

On bandwidth and edgesum for the composi
On bandwidth and edgesum for the composition of two graphs
โœ Jiuqiang Liu; Kenneth Williams ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 469 KB

The composition of two graphs G and H, written G[H], is the graph with vertex set V(G) x V(H) and with (u,, uI) adjacent to (ul, ul) if either u1 is adjacent to IQ in G or u1 = u2 and ul is adjacent to v2 in H. In this paper, we investigate the bandwidth problem for the composition of two graphs and