30 citations · 416 across the 73 of their papers we have counts for
11 papers · 1 filter
The additive-multiplicative distance matrix of a graph, and a novel third invariant
Projesh Nath Choudhury, Apoorva Khare
Graham showed with Pollak and Hoffman-Hosoya that for any directed graph with strong blocks , the determinant and cofactor-sum of the distance matri…
Blowup polynomials and delta-matroids of graphs
Projesh Nath Choudhury, Apoorva Khare
For every finite simple connected graph , we introduce an invariant, its blowup-polynomial . This is obtained by dividing the determinant of th…
Multivariate blowup-polynomials of graphs
Projesh Nath Choudhury, Apoorva Khare
In recent joint work (2021), we introduced a novel multivariate polynomial attached to every metric space - in particular, to every finite simple connected graph - and showed i…
Distance matrices of a tree: two more invariants, and in a unified framework
Projesh Nath Choudhury, Apoorva Khare
Graham-Pollak showed that for the distance matrix of a tree , det depends only on its number of edges. Several other variants of , including directed/multiplic…
The critical exponent: a novel graph invariant
Dominique Guillot, Apoorva Khare, Bala Rajaratnam
A surprising result of FitzGerald and Horn (1977) shows that is positive semidefinite (p.s.d.) for every entrywise nonnegative p.s.d. matri…
A combinatorial model for computing volumes of flow polytopes
Carolina Benedetti, Rafael S. González D'León, Christopher R. H. Hanusa +4
We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Bal…