Super link-connectivity of iterated line digraphs.
From MaRDI portal
Publication:1401417
DOI10.1016/S0304-3975(03)00282-2zbMATH Open1045.68019OpenAlexW2134334419MaRDI QIDQ1401417FDOQ1401417
Authors: Xiaoyan Cheng, Xiufeng Du, Manki Min, Lu Ruan, Weili Wu, Hung Q. Ngo, Jianhua 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Line Digraph Iterations and the (d, k) Digraph Problem
- Large generalized cycles
- Diameter vulnerability of iterated line digraphs
- A Design for Directed Graphs with Minimum Diameter
- Generalized de Bruijn digraphs
- Super edge connectivity properties of connected edge symmetric graphs
- Connectivity of Imase and Itoh digraphs
- Large fault-tolerant interconnection networks
- Cayley digraphs from complete generalized cycles
- Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
- Super Line-Connectivity Properties of Circulant Graphs
- Super edge-connectivity of dense digraphs and graphs
- Endo-circulant digraphs: Connectivity and generalized cycles
- Disjoint paths of bounded length in large generalized cycles
- Super line-connectivity of consecutive-\(d\) digraphs
- Diameter-vulnerability of large bipartite digraphs
- Line digraph iterations and diameter vulnerability
Cited In (6)
This page was built for publication: Super link-connectivity of iterated line digraphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401417)