Super link-connectivity of iterated line digraphs.
From MaRDI portal
Publication:1401417
DOI10.1016/S0304-3975(03)00282-2zbMath1045.68019OpenAlexW2134334419MaRDI QIDQ1401417
Xiufeng Du, Xiaoyan Cheng, Weili Wu, Lu Ruan, Manki Min, Hung Quang Ngo, Jian-Hua Sun
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00282-2
Related Items (3)
On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ Miscellaneous Digraph Classes
Cites Work
- Unnamed Item
- Large fault-tolerant interconnection networks
- Super edge-connectivity of dense digraphs and graphs
- Large generalized cycles
- Endo-circulant digraphs: Connectivity and generalized cycles
- Disjoint paths of bounded length in large generalized cycles
- Cayley digraphs from complete generalized cycles
- Super line-connectivity of consecutive-\(d\) digraphs
- Line digraph iterations and diameter vulnerability
- Diameter vulnerability of iterated line digraphs
- Diameter-vulnerability of large bipartite digraphs
- Line Digraph Iterations and the (d, k) Digraph Problem
- A Design for Directed Graphs with Minimum Diameter
- Super Line-Connectivity Properties of Circulant Graphs
- Generalized de Bruijn digraphs
- Connectivity of Imase and Itoh digraphs
- Super edge connectivity properties of connected edge symmetric graphs
- Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
This page was built for publication: Super link-connectivity of iterated line digraphs.
