The adjacency spectrum of two new operations of graphs

The adjacency spectrum of two new operations of graphs

Show other versions (1)

Let be a graph and be its adjacency matrix. The eigenvalues of are the eigenvalues of and form the adjacency spectrum, denoted by . In this paper, we introduce two new operations and , and describe the adjacency spectra of and of regular graphs , and arbitrarily graphs , in terms of their adjacency...

Full description

Bibliographic Details
Main Authors: Dijian Wang, Yaoping Hou, Zikai Tang
Format: Article
Language:English
Published: Taylor & Francis Group 2018-12-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
adjacency spectrum
cartesian product(of graphs)
integral graphs
Online Access:http://dx.doi.org/10.1016/j.akcej.2017.10.004
Description
Summary:Let be a graph and be its adjacency matrix. The eigenvalues of are the eigenvalues of and form the adjacency spectrum, denoted by . In this paper, we introduce two new operations and , and describe the adjacency spectra of and of regular graphs , and arbitrarily graphs , in terms of their adjacency spectra. As the applications, we obtain some new integral spectrum graphs.
ISSN:0972-8600

Similar Items