Some inner metric parameters of a digraph: iterated line digraphs and integer sequences
From MaRDI portal
Recommendations
Cites work
- A Note on the Order of Iterated Line Digraphs
- A survey of line digraphs and generalizations
- Automata and forbidden words
- Construction Techniques for Digraphs with Minimum Diameter
- Digraphs
- Graph theory
- scientific article; zbMATH DE number 3912382 (Why is no real title available?)
- scientific article; zbMATH DE number 3475479 (Why is no real title available?)
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 851097 (Why is no real title available?)
- scientific article; zbMATH DE number 3218572 (Why is no real title available?)
- Iterated line digraphs are asymptotically dense
- Line Digraph Iterations and the (d, k) Digraph Problem
- On the linegraph of a directed-graph
- Some properties of line digraphs
- The (, D) and (,N) problems in double-step digraphs with unilateral distance
- The diameter of cyclic Kautz digraphs
- The Polynomial of a Directed Graph
- The spectra of subKautz and cyclic Kautz digraphs
This page was built for publication: Some inner metric parameters of a digraph: iterated line digraphs and integer sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655972)