On a version of the spectral excess theorem
Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and diameter D, we give a characterization of when its distance matrix AD is a polynomial in A, in terms of the adjacency spectrum of G and the arithmetic (or harmonic) mean of the numbers of vertices at di...
Saved in:
Main Authors: | , |
---|---|
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2020-10-16.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |