The spectrum of the edge corona of two graphs

Yaoping Hou, Wai Chee SHIU

Research output: Contribution to journalArticlepeer-review

82 Citations (Scopus)

Abstract

Given two graphs G1, with vertices 1, 2,., n and edges e1, e2,..., em, and G2, the edge corona G1 {lozenge, open} G2 of G1 and G2 is defined as the graph obtained by taking m copies of G2 and for each edge ek = ij of G, joining edges between the two end-vertices i, j of ek and each vertex of the k-copy of G2. In this paper, the adjacency spectrum and Laplacian spectrum of G1 G2 are given in terms of the spectrum and Laplacian spectrum of G1 and G2, respectively. As an application of these results, the number of spanning trees of the edge corona is also considered.

Original languageEnglish
Pages (from-to)586-594
Number of pages9
JournalElectronic Journal of Linear Algebra
Volume20
DOIs
Publication statusPublished - Sep 2010

Scopus Subject Areas

  • Algebra and Number Theory

User-Defined Keywords

  • Adjacency matrix
  • Corona of graphs
  • Laplacian matrix
  • Spectrum

Fingerprint

Dive into the research topics of 'The spectrum of the edge corona of two graphs'. Together they form a unique fingerprint.

Cite this