105 citations · 118 across the 13 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009★ 3 cited
Counting the spanning trees of a directed line graph
Hoda Bidkhori, Shaunak Kishore
The line graph LG of a directed graph G has a vertex for every edge of G and an edge for every path of length 2 in G. In 1967, Knuth used the Matrix-Tree Theorem to prove a formula…
math.CO2009★ 1 cited
Strongly Cancellative and Recovering Sets On Lattices
ShinnYih Huang, Hoda Bidkhori
We use information theory to study recovering sets and strongly cancellative sets $\C_L$ on different lattices. These sets are special classes of recovering pairs and cancel…