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

Cited in

(89)

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