Most, And Least, Compact Spanning Trees of a Graph

by   Gyan Ranjan, et al.

We introduce the concept of Most, and Least, Compact Spanning Trees - denoted respectively by T^*(G) and T^#(G) - of a simple, connected, undirected and unweighted graph G(V, E, W). For a spanning tree T(G) βˆˆπ’―(G) to be considered T^*(G), where 𝒯(G) represents the set of all the spanning trees of the graph G, it must have the least average inter-vertex pair (shortest path) distances from amongst the members of the set 𝒯(G). Similarly, for it to be considered T^#(G), it must have the highest average inter-vertex pair (shortest path) distances. In this work, we present an iteratively greedy rank-and-regress method that produces at least one T^*(G) or T^#(G) by eliminating one extremal edge per iteration. The rank function for performing the elimination is based on the elements of the matrix of relative forest accessibilities of a graph and the related forest distance. We provide empirical evidence in support of our methodology using some standard graph families: complete graphs, the ErdΕ‘s-Renyi random graphs and the BarabΓ‘si-Albert scale-free graphs; and discuss computational complexity of the underlying methods which incur polynomial time costs.

βˆ™ 08/20/2021

A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph

We use a greedy strategy to list the spanning trees of the fan graph, F_...
βˆ™ 11/29/2013

Statistical estimation for optimization problems on graphs

Large graphs abound in machine learning, data mining, and several relate...
βˆ™ 08/19/2019

A New Fast Weighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees

Recently we submitted a paper, whose title is A New Fast Unweighted All-...
βˆ™ 01/26/2006

Optimal Traffic Networks

Inspired by studies on the airports' network and the physical Internet, ...
βˆ™ 07/24/2020

Computing nearest neighbour interchange distances between ranked phylogenetic trees

Many popular algorithms for searching the space of leaf-labelled trees a...
βˆ™ 05/27/2021

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

In static graphs, the betweenness centrality of a graph vertex measures ...
βˆ™ 11/24/2017

Recovering tree-child networks from shortest inter-taxa distance information

Phylogenetic networks are a type of leaf-labelled, acyclic, directed gra...

Please sign up or login with your details

Forgot password? Click here to reset