The rank of connection matrices and the dimension of graph algebras
From MaRDI portal
Publication:2493113
DOI10.1016/j.ejc.2005.04.012zbMath1088.05052arXivmath/0408232MaRDI QIDQ2493113
Publication date: 9 June 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0408232
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Unnamed Item, Perfect matchings, rank of connection tensors and graph homomorphisms, Graphon convergence of random cographs, Matroid invariants and counting graph homomorphisms, The rank of edge connection matrices and the dimension of algebras of invariant tensors, The automorphism group of a graphon, The large deviation principle for the Erdős-Rényi random graph, Distinguishing graphs by their left and right homomorphism profiles, Recurrence relations for graph polynomials on bi-iterative families of graphs, Estimating and understanding exponential random graph models, Generalized quasirandom graphs, Edge coloring models and reflection positivity, Contractors and connectors of graph algebras
Cites Work