On the profile of the corona of two graphs
Resource
Information Processing Letters 89,287-292
Journal
Information Processing Letters 89
Pages
287-292
Date Issued
2004
Date
2004
Author(s)
Lai, Yung-Ling
Chang, Gerard-J.
DOI
20060927121113617270
Abstract
The concept of profile, together with bandwidth, originates from handling sparse matrices in solving linear systems of equations. Given a graph G, the profile minimization problem is to find a one-to-one mapping f :V (G)→{1, 2, . . . , |V (G)|} such that Σv∈V(G) max x∈N[v](f (v) − f (x)) is as small as possible, where N[v] = {v} ∪ {x: x is adjacent to v}. This paper studies the profile of the corona G∧H of two graphs G & H. In particular, bounds for the profile of the corona of two graphs are established. Also, exact values of the profiles of coronas G∧H are obtained when G has certain properties, including when G is a caterpillar, a complete graph or a cycle.
Subjects
Profile
Corona
Numbering
Interval graph
Caterpillar
Complete graph
Cycle
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00122.pdf
Size
167.23 KB
Format
Adobe PDF
Checksum
(MD5):19fa2bf91016b2e6865c37eee02037fb