On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
type: Item
instance of: scholarly article
title: On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
zbMATH Open document ID: 1168.68037
author: Jinn-Shyong Yang
author: Jou-Ming Chang
author: Shyue-Ming Tang
author: Yue-Li Wang
published in: Theoretical Computer Science
publication date: 2009-05-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5558983
zbMATH Keywords: recursive circulant graphs
zbMATH Keywords: independent spanning trees
zbMATH Keywords: internally disjoint paths
zbMATH Keywords: fault-tolerant broadcasting
zbMATH Keywords: secure message distribution
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.12.042
OpenAlex ID: W2011353132
cites work: Pancyclicity of recursive circulant graphs
cites work: Edge-pancyclicity of recursive circulants
cites work: Hamiltonian decomposition of recursive circulant graphs
cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
cites work: Finding Four Independent Trees
cites work: Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
cites work: Independent spanning trees with small depths in iterated line digraphs
cites work: Q4232791
cites work: The multi-tree approach to reliability in distributed networks
cites work: Independent spanning trees of chordal rings
cites work: Q4427281
cites work: Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
cites work: Embedding trees in recursive circulants
cites work: Disjoint Hamiltonian cycles in recursive circulant graphs
cites work: Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
cites work: Recursive circulants and their embeddings among hypercubes
cites work: Multiplicative circulant networks. Topological properties and communication algorithms
cites work: The super-connected property of recursive circulant graphs
cites work: Maximum induced subgraph of a recursive circulant
cites work: Three tree-paths
DOI: 10.1016/J.TCS.2008.12.042
description: scientific article; zbMATH DE number 5558983