The degree-distance and transmission-adjacency matrices
From MaRDI portal
Publication:6590213
DOI10.1007/s40314-024-02870-9MaRDI QIDQ6590213
Octavio Zapata, Carlos A. Alfaro
Publication date: 21 August 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distance spectra of graphs
- Two Laplacians for the distance matrix of a graph
- On the sandpile group of the cone of a graph
- Smith normal form in combinatorics
- Elementary divisors of graphs and matroids
- Distance-regular graphs the distance matrix of which has only one positive eigenvalue
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Codeterminantal graphs
- On graphs with 2 trivial distance ideals
- Graphs with few trivial characteristic ideals
- Enumeration of cospectral and coinvariant graphs
- Cospectrality of graphs with respect to distance matrices
- Critical ideals, minimum rank and zero forcing number
- Distance ideals of graphs
- On the distance spectrum of distance regular graphs
- Cospectral graphs on 12 vertices
- On the critical ideals of graphs
- Graphs with two trivial critical ideals
- The structure of sandpile groups of outerplanar graphs
- Distance unimodular equivalence of graphs
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Integral complete multipartite graphs
This page was built for publication: The degree-distance and transmission-adjacency matrices