Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs
- Award ID(s):
- 1716828
- PAR ID:
- 10381503
- Date Published:
- Journal Name:
- 2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)
- Page Range / eLocation ID:
- 312 to 321
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
null (Ed.)A unified approach to the determination of eigenvalues and eigenvectors of specific matrices associated with directed graphs is presented. Matrices studied include the new distance matrix, with natural extensions to the distance Laplacian and distance signless Laplacian, in addition to the new adjacency matrix, with natural extensions to the Laplacian and signless Laplacian. Various sums of Kronecker products of nonnegative matrices are introduced to model the Cartesian and lexicographic products of digraphs. The Jordan canonical form is applied extensively to the analysis of spectra and eigenvectors. The analysis shows that Cartesian products provide a method for building infinite families of transmission regular digraphs with few distinct distance eigenvalues.more » « less
An official website of the United States government

