Results 31 to 40 of about 954,754 (291)
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 +4 more sources
Constructing Independent Spanning Trees on Pancake Networks
IEEE Access, 2020 For any graph G, the set of independent spanning trees (ISTs) is defined as the set of spanning trees in G. All ISTs have the same root, paths from the root to another vertex between distinct trees are vertex-disjoint and edge-disjoint.
Dun-Wei Cheng +2 more
doaj +1 more source
Some Characteristics of the Prime Graph of Integer Modulo Groups
InPrime, 2023 The notion of the prime graph of a ring R was first introduced by Bhavanari, Kuncham, and Dasari in 2010. The prime graph of a ring R, denoted by PG(R) is a graph whose vertices are all elements of the ring, where two distinct vertices x and y are ...
Muklas Maulana +3 more
doaj +1 more source
Ramsey Spanning Trees and Their Applications [PDF]
ACM Transactions on Algorithms, 2018 The metric Ramsey problem asks for the largest subset S of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version of Dvoretzky theorem.
Ittai Abraham +4 more
openaire +4 more sources
Construction Algorithm of Completely Independent Spanning Tree in Dragonfly Network [PDF]
Jisuanji kexue, 2022 Dragonfly network,proposed by Kim et al.,is a topology for high-performance computer systems.In dragonfly network,compute nodes are attached to switches,the switches are organized into groups,and the network is organized as a two-level clique.There is a ...
BIAN Qing-rong, CHENG Bao-lei, FAN Jian-xi, PAN Zhi-yong
doaj +1 more source
Computational Geometry, 2014 Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric spanning tree of S. In this work, we study the problem of finding a second plane geometric tree T' spanning S, such that is compatible with T and ...
Garcia Olaverri, Alfredo Martin +3 more
openaire +3 more sources
Chain-Constrained Spanning Trees [PDF]
Mathematical Programming, 2013 We consider the problem of finding a spanning tree satisfying a family of additional constraints. Several settings have been considered previously, the most famous being the problem of finding a spanning tree with degree constraints. Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as ...
Neil Olver, Rico Zenklusen
openaire +8 more sources
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Löwenstein +2 more
openaire +2 more sources
Lower-Stretch Spanning Trees [PDF]
SIAM Journal on Computing, 2005 We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)^2). Moreover, we show how to construct such a tree in time O(m log^2 n).
Michael Elkin +3 more
openaire +4 more sources
On Independent [1, 2]-Sets in Trees
Discussiones Mathematicae Graph Theory, 2018 An [1, k]-set S in a graph G is a dominating set such that every vertex not in S has at most k neighbors in it. If the additional requirement that the set must be independent is added, the existence of such sets is not guaranteed in every graph.
Aleid Sahar A. +2 more
doaj +1 more source