generalized symmetric distance matrix det
arxiv.org · 299 words · saved by 1 readers
N/A
The additive-multiplicative distance matrix of a graph, and a novel third invariant Graham showed with Pollak and Hoffman-Hosoya that for any directed graph $G$ with strong blocks $G_e$, the determinant $\det(D_G)$ and cofactor-sum $cof(D_G)$ of the distance matrix $D_G$ can be computed from the same quantities for the blocks $G_e$. This was extended to trees - and in our recent work to any graph - with multiplicative and $q$-distance matrices. For trees, we went further and unified all previous variants with weights in a unital commutative ring, into a distance matrix with additive and multi
saved by
related reading
- Arborescences of Random Covering Graphsarxiv.org
- Helly Theorems for Generalized Turán Problemsarxiv.org
- quasikernelarxiv.org
- 02_GyarfasLehel_AHellyTypeProblemInTrees.pdfusers.renyi.hu
- Exact Stability for Turan's Theoremarxiv.org
- nullstellensatzweb.math.princeton.edu
- [2604.27639] How large part of a graph can be covered by the neighborhoods of k vertices?arxiv.org
- [2604.04115] Gallai 3-colourings of random graphsarxiv.org
- refining bounds - cover timesarxiv.org
- Forbidding Exactly One Hamming Distancearxiv.org
- Induced rational exponents near twoarxiv.org
- [2603.23431] On the number of families avoiding a subposetarxiv.org