140,052 research outputs found
On the spanning tree packing number of a graph: a survey
AbstractThe spanning tree packing number or STP number of a graph G is the maximum number of edge-disjoint spanning trees contained in G. We use an observation of Paul Catlin to investigate the STP numbers of several families of graphs including quasi-random graphs, regular graphs, complete bipartite graphs, cartesian products and the hypercubes
A Simple Algorithm for Graph Reconstruction
How efficiently can we find an unknown graph using distance queries between
its vertices? We assume that the unknown graph is connected, unweighted, and
has bounded degree. The goal is to find every edge in the graph. This problem
admits a reconstruction algorithm based on multi-phase Voronoi-cell
decomposition and using distance queries.
In our work, we analyze a simple reconstruction algorithm. We show that, on
random -regular graphs, our algorithm uses distance
queries. As by-products, we can reconstruct those graphs using
queries to an all-distances oracle or queries to a betweenness
oracle, and we bound the metric dimension of those graphs by .
Our reconstruction algorithm has a very simple structure, and is highly
parallelizable. On general graphs of bounded degree, our reconstruction
algorithm has subquadratic query complexity
Connectivity Graph-Codes
The symmetric difference of two graphs on the same set of vertices
is the graph on whose set of edges are all edges that belong to exactly
one of the two graphs . For a fixed graph call a collection of spanning subgraphs of a connectivity code for if the symmetric
difference of any two distinct subgraphs in is a connected spanning
subgraph of . It is easy to see that the maximum possible cardinality of
such a collection is at most , where is
the edge-connectivity of and is its minimum degree. We show
that equality holds for any -regular (mild) expander, and observe that
equality does not hold in several natural examples including powers of long
cycles and products of a small clique with a long cycle
- …