Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018
How to Realize a Graph on Random Points
Saad Quader, Alexander Russell
We are given an integer , a graph , and a uniformly random embedding of the vertices. We are interested in the probability that can be…
cs.DM2012
A Beginner's Guide to Counting Spanning Trees in a Graph
Saad Quader
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors…