On the profile of the corona of two graphs

  • Authors:

  • Yung-Ling Lai;Gerard J. Chang

  • Affiliations:

  • Graduate Institute of Computer Science and Information Engineering, National Chia-Yi University, Chiayi, Taiwan;Department of Mathematics, National Taiwan University, Taipei 106, Taiwan

  • Venue:
  • Information Processing Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.89

Visualization

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) maxx ∈ 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 and 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.