Log in

Relevant bibliographies by topics / Independent Spanning Trees / Journal articles

To see the other types of publications on this topic, follow the link: Independent Spanning Trees.

Journal articles on the topic 'Independent Spanning Trees'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Independent Spanning Trees.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Khuller, Samir, and Baruch Schieber. "On independent spanning trees." Information Processing Letters 42, no. 6 (1992): 321–23. http://dx.doi.org/10.1016/0020-0190(92)90230-s.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hoyer, Alexander, and Robin Thomas. "Four Edge-Independent Spanning Trees." SIAM Journal on Discrete Mathematics 32, no. 1 (2018): 233–48. http://dx.doi.org/10.1137/17m1134056.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ali, Alonso, and Orlando Lee. "Five edge-independent spanning trees." Procedia Computer Science 223 (2023): 223–30. http://dx.doi.org/10.1016/j.procs.2023.08.232.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Araki, Toru, Masayoshi Matsushita, and Yota Otachi. "Completely independent spanning trees in (partial) k-trees." Discussiones Mathematicae Graph Theory 35, no. 3 (2015): 427. http://dx.doi.org/10.7151/dmgt.1806.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hong, Xia. "Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph." Contributions to Discrete Mathematics 19, no. 2 (2024): 23–35. http://dx.doi.org/10.55016/ojs/cdm.v19i2.62694.

Full text

Abstract:

Let $T_{1},T_{2},\dots,T_{k}$ 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 $T_{1},T_{2},\dots,T_{k}$ are completely independent spanning trees. In this paper, we give the definition of Minimal graph for $k$ completely independent spanning trees and we characterized all Minimal graphs for $k$ completely independent spanning trees. Finally, we obtain the number of completely independent spanning trees in complete $t(t\geq 2)$-partite graph $K_{n_{1},n_{2},\cdots,n_{t}}$, which is

APA, Harvard, Vancouver, ISO, and other styles

6

Lin, Jia-Cian, Jinn-Shyong Yang, Chiun-Chieh Hsu, and Jou-Ming Chang. "Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes." Information Processing Letters 110, no. 10 (2010): 414–19. http://dx.doi.org/10.1016/j.ipl.2010.03.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Darties, Benoît, Nicolas Gastineau, and Olivier Togni. "Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees." Discrete Applied Mathematics 236 (February 2018): 124–36. http://dx.doi.org/10.1016/j.dam.2017.11.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Yan, Jianxi Fan, Guodong Zhou, and Xiaohua Jia. "Independent spanning trees on twisted cubes." Journal of Parallel and Distributed Computing 72, no. 1 (2012): 58–69. http://dx.doi.org/10.1016/j.jpdc.2011.09.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Iwasaki, Yukihiro, Yuka Kajiwara, Koji Obokata, and Yoshihide Igarashi. "Independent spanning trees of chordal rings." Information Processing Letters 69, no. 3 (1999): 155–60. http://dx.doi.org/10.1016/s0020-0190(98)00205-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kim, Jong-Seok, Hyeong-Ok Lee, Eddie Cheng, and László Lipták. "Independent spanning trees on even networks." Information Sciences 181, no. 13 (2011): 2892–905. http://dx.doi.org/10.1016/j.ins.2011.02.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Cheng, Baolei, Jianxi Fan, Xiaohua Jia, and Shukui Zhang. "Independent spanning trees in crossed cubes." Information Sciences 233 (June 2013): 276–89. http://dx.doi.org/10.1016/j.ins.2013.01.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Wang, Shuo–I, and Fu–Hsing Wang. "Independent Spanning Trees in RTCC-Pyramids." Computer Journal 60, no. 1 (2016): 13–26. http://dx.doi.org/10.1093/comjnl/bxw054.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Zhang, Yan-Hong, Wei Hao, and Tao Xiang. "Independent spanning trees in crossed cubes." Information Processing Letters 113, no. 18 (2013): 653–58. http://dx.doi.org/10.1016/j.ipl.2013.06.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

HAMADA, Yukihiro. "Independent Spanning Trees of 2-Chordal Rings." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A, no. 1 (2016): 355–62. http://dx.doi.org/10.1587/transfun.e99.a.355.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Cheng, Bao Lei, Jian Xi Fan, Ji Wen Yang, Yan Wang, and Shu Kui Zhang. "Independent Spanning Trees on Special BC Networks." Applied Mechanics and Materials 263-266 (December 2012): 3301–5. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.3301.

Full text

Abstract:

There is a well-known conjecture on independent spanning trees (ISTs) on graphs: For any n-connected graph G with n≥1, there are n ISTs rooted at an arbitrary node on G. It still remains open for n≥5. We propose an integrated algorithm to construct n ISTs rooted at any node similar to 0 or 10n-1 on n-dimensional HCH cube for n≥1 and give the simulations of ISTs on several special BC networks, such as HCH cubes, crossed cubes, Möbius cubes, twisted cubes, etc.

APA, Harvard, Vancouver, ISO, and other styles

16

Lin, Chien-Fu, Jie-Fu Huang, and Sun-Yuan Hsieh. "Constructing Independent Spanning Trees on Transposition Networks." IEEE Access 8 (2020): 147122–32. http://dx.doi.org/10.1109/access.2020.3014822.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Cheng, Dun-Wei, Chih-Te Chan, and Sun-Yuan Hsieh. "Constructing Independent Spanning Trees on Pancake Networks." IEEE Access 8 (2020): 3427–33. http://dx.doi.org/10.1109/access.2019.2962549.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Tang, Shyue-Ming, Jinn-Shyong Yang, Yue-Li Wang, and Jou-Ming Chang. "Independent Spanning Trees on Multidimensional Torus Networks." IEEE Transactions on Computers 59, no. 1 (2010): 93–102. http://dx.doi.org/10.1109/tc.2009.98.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Hussain, Zaid, Bader AlBdaiwi, and Anton Cerny. "Node-independent spanning trees in Gaussian networks." Journal of Parallel and Distributed Computing 109 (November 2017): 324–32. http://dx.doi.org/10.1016/j.jpdc.2017.06.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Wang, Yan, Hong Shen, and Jianxi Fan. "Edge-independent spanning trees in augmented cubes." Theoretical Computer Science 670 (March 2017): 23–32. http://dx.doi.org/10.1016/j.tcs.2017.01.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Péterfalvi, Ferenc. "Two counterexamples on completely independent spanning trees." Discrete Mathematics 312, no. 4 (2012): 808–10. http://dx.doi.org/10.1016/j.disc.2011.11.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hong, Xia, and Qinghai Liu. "Degree condition for completely independent spanning trees." Information Processing Letters 116, no. 10 (2016): 644–48. http://dx.doi.org/10.1016/j.ipl.2016.05.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Fan, Genghua, Yanmei Hong, and Qinghai Liu. "Ore’s condition for completely independent spanning trees." Discrete Applied Mathematics 177 (November 2014): 95–100. http://dx.doi.org/10.1016/j.dam.2014.06.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Araki, Toru. "Dirac's Condition for Completely Independent Spanning Trees." Journal of Graph Theory 77, no. 3 (2013): 171–79. http://dx.doi.org/10.1002/jgt.21780.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Yang, Jinn-Shyong, and Jou-Ming Chang. "Independent spanning trees on folded hyper-stars." Networks 56, no. 4 (2010): 272–81. http://dx.doi.org/10.1002/net.20389.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Hasunuma, Toru, and Chie Morisaka. "Completely independent spanning trees in torus networks." Networks 60, no. 1 (2011): 59–69. http://dx.doi.org/10.1002/net.20460.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Kim, Jong-Seok, Hyeong-Ok Lee, Eddie Cheng, and László Lipták. "Optimal Independent Spanning Trees on Odd Graphs." Journal of Supercomputing 56, no. 2 (2009): 212–25. http://dx.doi.org/10.1007/s11227-009-0363-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Hong, Xia, and Wei Feng. "Completely independent spanning trees in some Cartesian product graphs." AIMS Mathematics 8, no. 7 (2023): 16127–36. http://dx.doi.org/10.3934/math.2023823.

Full text

Abstract:

<abstract><p>Let $ T_{1}, T_{2}, \dots, T_{k} $ 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 $ T_{1}, T_{2}, \dots, T_{k} $ are completely independent. Hasunuma showed that there are two completely independent spanning trees in any 4-connected maximal planar graph, and that given a graph $ G $, the problem of deciding whether there exist two completely independent spanning trees in $ G $ is NP-complete. In this paper, we consider the number of complete

APA, Harvard, Vancouver, ISO, and other styles

29

Cheng, Baolei, Jianxi Fan, Qiang Lyu, Cheng-Kuan Lin, Xiaoyan Li, and Guo Chen. "Constructing Node-Independent Spanning Trees in Augmented Cubes." Fundamenta Informaticae 176, no. 2 (2020): 103–28. http://dx.doi.org/10.3233/fi-2020-1965.

Full text

Abstract:

For a network, edge/node-independent spanning trees (ISTs) can not only tolerate faulty edges/nodes, but also be used to distribute secure messages. As important node-symmetric variants of the hypercubes, the augmented cubes have received much attention from researchers. The n-dimensional augmented cube AQn is both (2n ‒ 1)-edge-connected and (2n ‒ 1)-nodeconnected (n ≢ 3), thus the well-known edge conjecture and node conjecture of ISTs are both interesting questions in AQn. So far, the edge conjecture on augmented cubes was proved to be true. However, the node conjecture on AQn is still open.

APA, Harvard, Vancouver, ISO, and other styles

30

PAI, Kung-Jui, Jinn-Shyong YANG, Sing-Chen YAO, Shyue-Ming TANG, and Jou-Ming CHANG. "Completely Independent Spanning Trees on Some Interconnection Networks." IEICE Transactions on Information and Systems E97.D, no. 9 (2014): 2514–17. http://dx.doi.org/10.1587/transinf.2014edl8079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Liu, Yi-Jiun, James K. Lan, Well Y. Chou, and Chiuyuan Chen. "Constructing independent spanning trees for locally twisted cubes." Theoretical Computer Science 412, no. 22 (2011): 2237–52. http://dx.doi.org/10.1016/j.tcs.2010.12.061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Darties, Benoit, Nicolas Gastineau, and Olivier Togni. "Completely independent spanning trees in some regular graphs." Discrete Applied Mathematics 217 (January 2017): 163–74. http://dx.doi.org/10.1016/j.dam.2016.09.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Cheng, Baolei, Dajin Wang, and Jianxi Fan. "Constructing completely independent spanning trees in crossed cubes." Discrete Applied Mathematics 219 (March 2017): 100–109. http://dx.doi.org/10.1016/j.dam.2016.11.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Chen, Xiaodong, Qinghai Liu, and Xiwu Yang. "Two completely independent spanning trees of split graphs." Discrete Applied Mathematics 340 (December 2023): 76–78. http://dx.doi.org/10.1016/j.dam.2023.07.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

MIURA, KAZUYUKI, DAISHIRO TAKAHASHI, SHIN-ICHI NAKANO, and TAKAO NISHIZEKI. "A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS." International Journal of Foundations of Computer Science 10, no. 02 (1999): 195–210. http://dx.doi.org/10.1142/s0129054199000149.

Full text

Abstract:

Given a graph G, a designated vertex r and a natural number k, we wish to find k "independent" spanning trees of G rooted at r, that is, k spanning trees such that the k paths connecting r and any vertex v in the k trees are internally disjoint. In this paper we give a linear-time algorithm to find four independent spanning trees in a 4-connected planar graph.

APA, Harvard, Vancouver, ISO, and other styles

36

Li, Xiaorui, Baolei Cheng, Jianxi Fan, Yan Wang, and Dajin Wang. "On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes." Fundamenta Informaticae 193, no. 1-4 (2023): 11–28. https://doi.org/10.1177/01692968241310647.

Full text

Abstract:

A network can contain numerous spanning trees. If two spanning trees T i , T j do not share any common edges, T i and T j are said to be pairwisely edge-disjoint. For spanning trees T 1 , T 2 ,…, T m , if every two of them are pairwisely edge-disjoint, they are called completely edge-independent spanning trees (CEISTs for short). CEISTs can facilitate many network functionalities, and constructing CEISTs as maximally allowed as possible in a given network is a worthy undertaking. In this paper, we establish the maximal number of CEISTs in the locally twisted cube network, and propose an algori

APA, Harvard, Vancouver, ISO, and other styles

37

YANG, Yi-Xian, Kung-Jui PAI, Ruay-Shiung CHANG, and Jou-Ming CHANG. "Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes." IEICE Transactions on Information and Systems E102.D, no. 12 (2019): 2409–12. http://dx.doi.org/10.1587/transinf.2019pal0001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Chen, Xiaodong, Mingchu Li, and Liming Xiong. "Two completely independent spanning trees of claw-free graphs." Discrete Mathematics 345, no. 12 (2022): 113080. http://dx.doi.org/10.1016/j.disc.2022.113080.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Cheng, Dun-Wei, Kai-Hsun Yao, and Sun-Yuan Hsieh. "Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs." IEEE Access 9 (2021): 74028–37. http://dx.doi.org/10.1109/access.2021.3080315.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

CHANG, Jou-Ming, Hung-Yi CHANG, Hung-Lung WANG, Kung-Jui PAI, and Jinn-Shyong YANG. "Completely Independent Spanning Trees on 4-Regular Chordal Rings." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100.A, no. 9 (2017): 1932–35. http://dx.doi.org/10.1587/transfun.e100.a.1932.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Yang, Jinn-Shyong, Jou-Ming Chang, Kung-Jui Pai, and Hung-Chang Chan. "Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes." IEEE Transactions on Parallel and Distributed Systems 26, no. 11 (2015): 3090–98. http://dx.doi.org/10.1109/tpds.2014.2367498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Yang, Jinn-Shyong, Shyue-Ming Tang, Jou-Ming Chang, and Yue-Li Wang. "Parallel construction of optimal independent spanning trees on hypercubes." Parallel Computing 33, no. 1 (2007): 73–79. http://dx.doi.org/10.1016/j.parco.2006.12.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Chen, Xie-Bin. "Construction of optimal independent spanning trees on folded hypercubes." Information Sciences 253 (December 2013): 147–56. http://dx.doi.org/10.1016/j.ins.2013.07.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Cheng, B., J. Fan, X. Jia, S. Zhang, and B. Chen. "Constructive Algorithm of Independent Spanning Trees on Mobius Cubes." Computer Journal 56, no. 11 (2012): 1347–62. http://dx.doi.org/10.1093/comjnl/bxs123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Chang, Jou-Ming, Jhen-Ding Wang, Jinn-Shyong Yang, and Kung-Jui Pai. "A comment on “Independent spanning trees in crossed cubes”." Information Processing Letters 114, no. 12 (2014): 734–39. http://dx.doi.org/10.1016/j.ipl.2014.06.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Cheng, Baolei, Jianxi Fan, Xiaohua Jia, and Jin Wang. "Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes." Journal of Parallel and Distributed Computing 73, no. 5 (2013): 641–52. http://dx.doi.org/10.1016/j.jpdc.2013.01.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Gitik, Rivka, Or Bartal, and Leo Joskowicz. "Euclidean minimum spanning trees with independent and dependent geometric uncertainties." Computational Geometry 96 (June 2021): 101744. http://dx.doi.org/10.1016/j.comgeo.2020.101744.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Hong, Xia. "Completely independent spanning trees in k-th power of graphs." Discussiones Mathematicae Graph Theory 38, no. 3 (2018): 801. http://dx.doi.org/10.7151/dmgt.2038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Cheng, Baolei, Jianxi Fan, and Xiaohua Jia. "Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks." IEEE Transactions on Parallel and Distributed Systems 26, no. 1 (2015): 45–53. http://dx.doi.org/10.1109/tpds.2014.2307871.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Yang, Jinn-Shyong, Jou-Ming Chang, Shyue-Ming Tang, and Yue-Li Wang. "Reducing the Height of Independent Spanning Trees in Chordal Rings." IEEE Transactions on Parallel and Distributed Systems 18, no. 5 (2007): 644–57. http://dx.doi.org/10.1109/tpds.2007.351709.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!