Results 11 to 20 of about 166,225,520 (254)

Enumerating the Number of Spanning Trees of Pyramid Graphs Based on Some Nonahedral Graphs

Axioms
The enumeration of spanning trees in various graph forms has been made easier by the study of electrically equivalent transformations, which was motivated by Kirchhoff’s work on electrical networks.
Ahmad Asiri, Salama Nagy Daoud
doaj   +2 more sources

Constructive Heuristics for the Minimum Labelling Spanning Tree Problem: a preliminary comparison [PDF]

, 2006
This report studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible.
Moreno, J A, Darby-Dowman, K, Mladenović, N, Consoli, S   +3 more
core   +6 more sources

The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type [PDF]

, 2011
Approaching topics such as connected simple graph, k-partite graph, complete graph, tree, Smarandache (E1,E2)-number of ...
Junliang Cai, Cai, Junliang, Xiaoli Liu, Liu, Xiaoli   +3 more
core   +1 more source

Estimating the weight of metric minimum spanning trees in sublinear time [PDF]

, 2008
In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Christian Sohler, Artur Czumaj, Sohler, Christian, Czumaj, Artur   +3 more
core   +1 more source

On the probabilistic min spanning tree Problem [PDF]

, 2010
International audienceWe study a probabilistic optimization model for min spanning tree, where any vertex v i of the input-graph G(V, E) has some presence probability p i in the final instance G′ ⊂ G that will effectively be optimized.
Paschos, V.T., V. T. Paschos, Cécile Murat, Nicolas Boria, MURAT, Cécile, C. Murat, Vangelis Th Paschos, Vangelis Paschos, Paschos, Vangelis, Boria, Nicolas, Murat, C.   +10 more
core   +1 more source

Spanning trees with generalized degree constraints arising in the design of wireless networks [PDF]

, 2011
In this paper we describe a minimum spanning tree problem with generalized degree constraints which arises in the design of wireless networks. The signal strength on the receiver side of a wireless link decreases with the distance between transmitter and
Luís Gouveia, Amaro de Sousa, Gouveia, Luís, Pedro Moura, Moura, Pedro, Sousa, Amaro de   +5 more
core   +1 more source

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

IEEE Access, 2021
A set of the spanning trees in a graph $G$ is called independent spanning trees if they have a common root $r$ and for each vertex $v\in V(G)\setminus \{r\}$ , the paths from $v$ to $r$ in any two trees are directed edge-disjoint and internally ...
Yi-Cheng Yang, Shih-Shun Kao, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, Jou-Ming Chang   +5 more
doaj   +1 more source

Number of Spanning Trees in the Sequence of Some Graphs

Complexity, 2019
In mathematics, one always tries to get new structures from given ones. This also applies to the realm of graphs, where one can generate many new graphs from a given set of graphs.
Jia-Bao Liu, S. N. Daoud
doaj   +1 more source

Number of spanning trees of some families of graphs generated by a triangle

Journal of Taibah University for Science, 2019
In mathematics, one always tries to get new structures from given ones. This also applies to the realm of graphs, where one can generate many new graphs from a given set of graphs.
S. N. Daoud
doaj   +1 more source

Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem [PDF]

, 2009
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Darby-Dowman, K, Mladenović, N, Consoli, S, Moreno-Pérez, JA   +3 more
core   +1 more source