Results 201 to 210 of about 4,433,930 (229)
Some of the next articles are maybe not open access.
Two completely independent spanning trees of split graphs
Discrete Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaodong Chen, Qinghai Liu, Xiwu Yang
openaire +3 more sources
Two Completely Independent Spanning Trees of $$P_4$$-Free Graphs
Graphs and Combinatorics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaodong Chen, Jingjing Li, Fuliang Lu
openaire +2 more sources
Completely independent spanning trees in torus networks
Networks, 2011AbstractLet T1, T2, …, Tk be spanning trees in a graph G. If for any two vertices u, v in G, the paths from u to v in T1, T2, …, Tk are pairwise internally disjoint, then T1, T2, …, Tk are completely independent spanning trees in G. Completely independent spanning trees can be applied to fault‐tolerant communication problems in interconnection networks.
Toru Hasunuma, Chie Morisaka
openaire +3 more sources
Comments on “A Hamilton sufficient condition for completely independent spanning tree”
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiao-Wen Qin +3 more
openaire +3 more sources
Dirac's Condition for Completely Independent Spanning Trees
Journal of Graph Theory, 2013AbstractTwo spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. In this article, we show two sufficient conditions for the existence of completely independent spanning trees. First, we show that a graph of n vertices has two completely independent
openaire +1 more source
Two completely independent spanning trees of claw-free graphs
Discrete Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaodong Chen, Mingchu Li, Liming Xiong
openaire +1 more source
A Sufficient Condition for the Existence of Two Completely Independent Spanning Trees
Lecture Notes in Computer ScienceBo Ning
exaly +2 more sources
New comments on “A Hamilton sufficient condition for completely independent spanning tree”
Discrete Applied Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Junjiang Li, Guifu Su, Guanbang Song
openaire +1 more source
Construction of Completely Independent Spanning Tree Based on Vertex Degree
2021Interconnection networks have been extensively studied in the field of parallel computer systems. In the interconnection network, completely independent spanning tree (CISTs) plays an important role in the reliable transmission, parallel transmission, and safe distribution of information. Two spanning trees \(T_1\) and \(T_2\) of graph G are completely
Ningning Liu, Yujie Zhang, Weibei Fan
openaire +1 more source
Vertex-independent spanning trees in complete Josephus cubes
Theoretical Computer SciencezbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qi He +3 more
openaire +1 more source