Distance ideals of graphs
From MaRDI portal
Publication:2332421
DOI10.1016/j.laa.2019.09.012zbMath1426.05060arXiv1709.10178OpenAlexW2973699993MaRDI QIDQ2332421
Libby Taylor, Carlos A. Alfaro
Publication date: 4 November 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.10178
Algebraic combinatorics (05E99) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (5)
Codeterminantal graphs ⋮ On graphs with 2 trivial distance ideals ⋮ The structure of sandpile groups of outerplanar graphs ⋮ Graphs with few trivial characteristic ideals ⋮ Enumeration of cospectral and coinvariant graphs
Uses Software
Cites Work
- Critical ideals of signed graphs with twin vertices
- On the sandpile group of the cone of a graph
- Smith normal form in combinatorics
- Trivially perfect graphs
- Small clique number graphs with three trivial critical ideals
- Graphs with real algebraic co-rank at most two
- Quasi-threshold graphs
- Distance spectra of graphs: a survey
- Critical ideals, minimum rank and zero forcing number
- On the critical ideals of graphs
- Graphs with two trivial critical ideals
- Equivalence of Hadamard matrices
- Invariant factors of combinatorial matrices
- The chip-firing game
- Smith normal form of some distance matrices
- Distance unimodular equivalence of graphs
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Graph Classes: A Survey
- Odd Holes in Bull-Free Graphs
- A new characterization of trivially perfect graphs
- Digraphs with at most one trivial critical ideal
- On the Addressing Problem for Loop Switching
This page was built for publication: Distance ideals of graphs
