Theorical foundation of Matrix, Graphs, and Trees --- This READ-ME document contains my annotations in matrices, graphs, and trees from my theoretical studies. I will add some of my Python exercises ...

This repo focus on the problem of finding a minimum spanning tree of an undirected graph. Implemented a parallel algorithm for finding the minimum spanning tree of an undirected graph using whatever ...

We use the commute-time to locate the minimum spanning tree of the graph. The spanning trees located using commute time prove to be stable to structural variations. We match the graphs by applying a ...

Abstract: The central concern of this thesis is the study of the Russo-Seymour-Welsh (RSW) theory. The first contribution of this thesis is a macroscopic decorrelation result for uniform spanning ...

A set of k spanning trees rooted at the same vertex r in a graph G is called independent [and the trees are called independent spanning trees (ISTs)] if, for any vertex x ≠ r, the k paths from x to r, ...

Abstract A k- tree of a connected graph G is a spanning tree with maximum degree at most k. The rupture degree for a connected graph G is defined by , where and , respectively, denote the order of the ...

ABSTRACT: Let denote the maximum number of disjoint bases in a matroid . For a connected graph , let , where is the cycle matroid of . The well-known spanning tree packing theorem of Nash-Williams and ...