Completely Independent Spanning Trees in k-Th Power of Graphs

Let T1, T2, . . . , Tk be spanning trees of a graph G. For any two vertices u, v of G, if the paths from u to v in these k trees are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent. Araki showed that the square of a 2-connected graph G on n vertices with n ≥...

Full description

Bibliographic Details
Published in:	Discussiones Mathematicae Graph Theory
Main Author:	Hong Xia
Format:	Article
Language:	English
Published:	University of Zielona Góra 2018-08-01
Subjects:	completely independent spanning tree power of graphs spanning trees 05c05
Online Access:	https://doi.org/10.7151/dmgt.2038

Similar Items

Completely Independent Spanning Trees in (Partial) k-Trees
by: Matsushita Masayoshi, et al.
Published: (2015-08-01)

NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01)

Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
by: Furuya Michitaka, et al.
Published: (2022-02-01)

On Independent [1, 2]-Sets in Trees
by: Aleid Sahar A., et al.
Published: (2018-08-01)

The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01)

On the Minimum Number of Spanning Trees in Cubic Multigraphs
by: Bogdanowicz Zbigniew R.
Published: (2020-02-01)

Spanning Trees with Disjoint Dominating and 2-Dominating Sets
by: Miotk Mateusz, et al.
Published: (2022-02-01)

Completely independent spanning trees in some Cartesian product graphs
by: Xia Hong, et al.
Published: (2023-05-01)

Construction Algorithm of Completely Independent Spanning Tree in Dragonfly Network
by: BIAN Qing-rong, CHENG Bao-lei, FAN Jian-xi, PAN Zhi-yong
Published: (2022-11-01)

Maximizing the Index of Signed Complete Graphs Containing a Spanning Tree with <i>k</i> Pendant Vertices
by: Dan Li, et al.
Published: (2024-08-01)

2-Spanning Cyclability Problems of Some Generalized Petersen Graphs
by: Yang Meng-Chien, et al.
Published: (2020-08-01)

Exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph
by: Alexander V. Smirnov
Published: (2025-06-01)

Tr-Span of Directed Wheel Graphs
by: Besson Marc, et al.
Published: (2018-11-01)

Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
by: Sung Sik U
Published: (2016-10-01)

Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
by: Azarija Jernej
Published: (2013-09-01)

Performance Evaluation using Spanning Tree Protocol, Rapid Spanning Tree Protocol, Per-VLAN Spanning Tree, and Multiple Spanning Tree
by: Dana Faiq Abd, et al.
Published: (2024-01-01)

Constructing Independent Spanning Trees on Transposition Networks
by: Chien-Fu Lin, et al.
Published: (2020-01-01)

Decompositions of Cubic Traceable Graphs
by: Liu Wenzhong, et al.
Published: (2020-02-01)

Dual Protection Routing Trees on Graphs
by: Kung-Jui Pai
Published: (2023-07-01)

PENGGUNAAN METODE CUTTING PLANE UNTUK MENYELESAIKAN MINIMUM SPANNING TREE DENGAN KENDALA BOBOT PADA GRAF K_n
by: Dewi Suhika, et al.
Published: (2018-06-01)

Spanning k-ended trees of 3-regular connected graphs
by: Hamed Ghasemian Zoeram, et al.
Published: (2017-10-01)

Constructing Independent Spanning Trees on Pancake Networks
by: Dun-Wei Cheng, et al.
Published: (2020-01-01)

An improved upper bound on the independent double Roman domination number of trees
by: F. Nahani Pour, et al.
Published: (2022-09-01)

Building direct and back spanning trees by automata on a graph
by: Igor Burdonov, et al.
Published: (2018-10-01)

The number of spanning trees in a superprism
by: Zbigniew R. Bogdanowicz
Published: (2024-04-01)

Algorithm to Construct Node-independent Spanning Trees in Data Center Network BCDC
by: PAN Zhi-yong, CHENG Bao-lei, FAN Jian-xi, BIAN Qing-rong
Published: (2022-07-01)

Independent Transversal Total Domination Versus Total Domination in Trees
by: Martínez Abel Cabrera, et al.
Published: (2021-02-01)

Enumerating the Number of Spanning Trees of Pyramid Graphs Based on Some Nonahedral Graphs
by: Ahmad Asiri, et al.
Published: (2025-02-01)

Some Results on the Independence Polynomial of Unicyclic Graphs
by: Oboudi Mohammad Reza
Published: (2018-05-01)

A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
by: Chen Guantao, et al.
Published: (2024-09-01)

Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning
by: Masoud Ghods, et al.
Published: (2020-09-01)

Signed Complete Graphs with Maximum Index
by: Akbari Saieed, et al.
Published: (2020-05-01)

Packing Trees in Complete Bipartite Graphs
by: Wang Jieyan
Published: (2022-02-01)

Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
by: Jie-Fu Huang, et al.
Published: (2020-01-01)

Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs
by: Mao Luo, et al.
Published: (2024-03-01)

On relation between the Kirchhoff index and number of spanning trees of graph
by: Igor Milovanovic, et al.
Published: (2020-06-01)

Intersection of random spanning trees in complex networks
by: András London, et al.
Published: (2023-10-01)

Spanning trees with small diameters
by: Mikio Kano, et al.
Published: (2020-01-01)

Parallel Construction of Edge-independent Spanning Trees in Augmented Cubes
by: LI Xiajing, CHENG Baolei, FAN Jianxi, WANG Yan, LI Xiaorui
Published: (2024-09-01)

On a Spanning k-Tree in which Specified Vertices Have Degree Less Than k
by: Matsumura Hajime
Published: (2015-02-01)