A cospectral construction for the generalized distance matrix
The generalized distance matrix of a graph is a matrix in which the (i,j)\left(i,j)th entry is a function, ff, of the distance between vertex ii and vertex jj. Depending on the choice of ff, this family of matrices includes both the adjacency matrix and the traditional distance matrix. We present a...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2025-07-01
|
| Series: | Special Matrices |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/spma-2025-0037 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|