Aα-Spectral Characterizations of Some Joins
Let G be a graph with n vertices. For every real α∈0,1, write AαG for the matrix AαG=αDG+1−αAG, where AG and DG denote the adjacency matrix and the degree matrix of G, respectively. The collection of eigenvalues of AαG together with multiplicities are called the Aα-spectrum of G. A graph G is said t...
Saved in:
Main Authors: | Tingzeng Wu, Tian Zhou |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2020-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2020/8294312 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Per-Spectral Characterizations of Bicyclic Networks
by: Tingzeng Wu, et al.
Published: (2017-01-01) -
Distance Spectra of Some Double Join Operations of Graphs
by: B. J. Manjunatha, et al.
Published: (2024-01-01) -
Their Joined-Up Family /
by: Salonen, Debra
Published: (2007) -
Backward Spectral Characterization of Liquid Crystal Display Based on Forward Spectral Characterization
by: Jian-qing Zhang, et al.
Published: (2016-01-01) -
Joins of Euclidean orbital topologies
by: Ellen Clay
Published: (1997-01-01)