Line Digraph Iterations and the (d, k) Digraph Problem

Cited in

(89)

A line digraph of a complete bipartite digraph
On large vertex-symmetric digraphs
The k-restricted edge connectivity of undirected Kautz graphs
The line digraph of a regular and pancircular digraph is also regular and pancircular
Large fault-tolerant interconnection networks
Extensions of networks with given diameter
Graphs on alphabets as models for large interconnection networks
Super edge-connectivity of dense digraphs and graphs
The underlying graph of a line digraph
Large generalized cycles
Superconnectivity of bipartite digraphs and graphs
Disjoint paths of bounded length in large generalized cycles
On the existence of \((d,k)\)-digraphs
On a problem of walks
Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
On the matrix equation \(A^l+A^{l+k}=J_n\)
The superconnectivity of large digraphs and graphs
On the distance connectivity of graphs and digraphs
Connectivity and fault-tolerance of hyperdigraphs
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
Digraphs on permutations
Connectivity of large bipartite digraphs and graphs
Uniform homomorphisms of de Bruijn and Kautz networks
Super link-connectivity of iterated line digraphs.
Diameter vulnerability of GC graphs
Automorphism groups of k-arc transitive covers.
Weakly distance-regular digraphs.
On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices
Zero forcing in iterated line digraphs
De Bruijn and Kautz digraphs of a rooted tree
Vertex-symmetric digraphs with small diameter
On Cayley line digraphs
Large (d,D, D',s)-bipartite digraphs
Diameter vulnerability of iterated line digraphs
Diameter-vulnerability of large bipartite digraphs
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. II
Bipartite graphs and digraphs with maximum connectivity
Structural properties of subdivided-line graphs
Identifying codes in line digraphs
About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs
An algebraic approach to lifts of digraphs
On the acyclic disconnection and the girth
Iterated line digraphs are asymptotically dense
On the k-tuple domination of de Bruijn and Kautz digraphs
Edge-connectivity and edge-superconnectivity in sequence graphs
The spectra of subKautz and cyclic Kautz digraphs
On the structure of the adjacency matrix of the line digraph of a regular digraph
Asymptotically large (\(\Delta,D\))-graphs
Cospectral digraphs from locally line digraphs
Spanners of de Bruijn and Kautz graphs
Containment of butterflies in networks constructed by the line digraph operation
On large ( , D, D, 1)-graphs
Miscellaneous digraph classes
The diameter of cyclic Kautz digraphs
New cyclic Kautz digraphs with optimal diameter
Restricted arc-connectivity of generalized \(p\)-cycles
On Moore bipartite digraphs
On the unilateral (?,D*)-problem
Partial line directed hypergraphs
Superconnected digraphs and graphs with small conditional diameters
The degree-diameter problem for sparse graph classes
Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism
The diameter of cyclic Kautz digraphs
Sequence mixed graphs
On \(d\)-Fibonacci digraphs
Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing
A Note on the Order of Iterated Line Digraphs
On the super-restricted arc-connectivity of s-geodetic digraphs
On the weak distance-regularity of Moore-type digraphs
Independent spanning trees with small depths in iterated line digraphs
Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays
The underlying line digraph structure of some (0, 1)-matrix equations
On the restricted arc-connectivity of \(s\)-geodetic digraphs
Moore mixed graphs from Cayley graphs
Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing
Sandpile groups and spanning trees of directed line graphs
On large regular \(( 1 , 1 , k )\)-mixed graphs
Some inner metric parameters of a digraph: iterated line digraphs and integer sequences
Network routing on regular digraphs and their line graphs
On the number of spanning trees and Eulerian tours in iterated line digraphs
Connectivity of Kautz networks
On the restricted arc-connectivity of oriented graphs
Diameter, short paths and superconnectivity in digraphs
Super p-restricted edge connectivity of line graphs
Multipartite Moore digraphs
The spectra of some families of digraphs
Queue layouts of iterated line directed graphs
The spectra of Manhattan street networks
Kernels and partial line digraphs

This page was built for publication: Line Digraph Iterations and the (d, k) Digraph Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309081)