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

On bandwidth and edgesum for the composition of two graphs

โœ Scribed by Jiuqiang Liu; Kenneth Williams

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
469 KB
Volume
143
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 obtain the bandwidth for several classes of graphs of the forms K,[G] and K,,JG]. We also provide optimal numberings which solve the graph edgesum problem for K, [P,,,] and K, CC,,,].

๐Ÿ“œ SIMILAR VOLUMES

A survey of solved problems and applicat
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
โœ Lai, Yung-Ling; Williams, Kenneth ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 281 KB ๐Ÿ‘ 1 views

This article provides a survey of results on the exact bandwidth, edgesum, and profile of graphs. A bibliography of work in these areas is provided. The emphasis is on composite graphs. This may be regarded as an update of the original survey of solved bandwidth problems by Chinn, Chvรกtalovรก, Dewdne

On the two-edge-colorings of perfect gra
On the two-edge-colorings of perfect graphs
โœ Chรญnh T. Hoร ng ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 409 KB ๐Ÿ‘ 1 views

## Abstract We investigate the conjecture that a graph is perfect if it admits a twoโ€edgeโ€coloring such that two edges receive different colors if they are the nonincident edges of a __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. ยฉ 1995 Joh

On the perfect orderability of unions of
On the perfect orderability of unions of two graphs
โœ Ho๏ฟฝng, Ch๏ฟฝnh T.; Tu, Xiaodan ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 264 KB ๐Ÿ‘ 3 views

A graph G is perfectly orderable, if it admits an order < on its vertices such that the sequential coloring algorithm delivers an optimum coloring on each induced subgraph (H, <) of (G, <). A graph is a threshold graph, if it contains no P 4 , 2K 2 , and C 4 as induced subgraph. A theorem of Chvรกtal

Comparison of two indices for the invest
Comparison of two indices for the investigation of cooperation graphs
โœ Geldenhuys, Gerhard ;Human, Lez๏ฟฝnne ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 495 KB ๐Ÿ‘ 1 views

An index of cohesion for the investigation of communication between authors or academic units is described and compared with the Brillouin-Shaw index. The Brillouin-Shaw index has the advantage of relatively easy computation, but it cannot bring out the same nuances as the index of cohesion.