Results 21 to 30 of about 80,587 (266)
Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G.
Furuya Michitaka +5 more
doaj +1 more source
On the Longest Spanning Tree with Neighborhoods [PDF]
Discrete Mathematics, Algorithms and Applications, 2018 We study a maximization problem for geometric network design. Given a set of [Formula: see text] compact neighborhoods in [Formula: see text], select a point in each neighborhood, so that the longest spanning tree on these points (as vertices) has maximum length. Here, we give an approximation algorithm with ratio [Formula: see text], which represents
Ke Chen 0011, Adrian Dumitrescu
openaire +2 more sources
Generalized minimum spanning tree games
EURO Journal on Computational Optimization, 2016 The minimum-cost spanning tree game is a special class of cooperative games defined on a graph with a set of vertices and a set of edges, where each player owns a vertex. Solutions of the game represent ways to distribute the total cost of a minimum-cost
PhuocHoang Le +2 more
doaj +1 more source
Spanning Trees—Short or Small [PDF]
SIAM Journal on Discrete Mathematics, 1996 We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is the $k$MST problem in which we require a tree of minimum weight spanning at least $k$ nodes in an edge-weighted ...
R. Ravi 0001 +4 more
openaire +3 more sources
MENCARI MINIMUM SPANNING TREE DENGAN KONSTREN
Jurnal Matematika UNAND, 2019 Misalkan G = (V, E) adalah graf tak berarah terhubung yang bukan tree, berarti di G terdapat cycle. Dengan cyclic interchange maka diperoleh subgraf T yang tidak memuat cycle. Subgraf T inilah yang dinamakan dengan spanning tree.
Miftahul Jannah +2 more
doaj +1 more source
Linking and Cutting Spanning Trees [PDF]
Algorithms, 2018 We consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs, we prove that this approach significantly outperforms existing algorithms.
Luís M. S. Russo +2 more
openaire +4 more sources
Implementasi VLAN dan Spanning Tree Protocol Menggunakan GNS 3 dan Pengujian Sistem Keamanannya
Khazanah Informatika, 2018 Pada saat ini, jaringan komputer telah banyak digunakan dalam berbagai macam bidang dan telah mengalami perkembangan yang sangat pesat. Hampir setiap perusahaan atau organisasi menggunakan jaringan komputer.
Wahyu Saputra, Fajar Suryawan
doaj +1 more source
Breaking intractability of spanning caterpillar tree problem: A logical approach [PDF]
AUT Journal of Mathematics and Computing, 2022 In this paper we pursue a logical approach to prove that the optimisation problem of finding a spanning caterpillar tree in a graph has polynomial algorithm for bounded tree width graphs.
Masoud Khosravani
doaj +1 more source
Discrete Mathematics, 1992 The paper studies spanning trees of a cactus. A cactus is a connected graph in which each block is either an edge or a circuit. A rooted graph is an ordered pair \((G,R)\), where \(G\) is a graph and \(R\) is a set of its vertices which contains exactly one vertex from each connected component of \(G\).
Vestergaard, Preben Dahl, Egawa, Y.
openaire +3 more sources
Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
Electronic Journal of Graph Theory and Applications, 2016 This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs $K_m+H_n$ and $K_m+K_{n,p}$, where $H_n$ is a graph with $n$ isolated vertices.
Sung Sik U
doaj +1 more source