Line Digraph Iterations and the (d, k) Digraph Problem
From MaRDI portal
Publication:3309081
DOI10.1109/TC.1984.1676455zbMath0528.68048OpenAlexW1975203667MaRDI QIDQ3309081
J. Luis A. Yebra, Ignacio Alegre de Miquel, Miquel Àngel Fiol
Publication date: 1984
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1984.1676455
Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items
Cospectral digraphs from locally line digraphs ⋮ Iterated line digraphs are asymptotically dense ⋮ Spanners of de Bruijn and Kautz graphs ⋮ Containment of butterflies in networks constructed by the line digraph operation ⋮ Partial line directed hypergraphs ⋮ Superconnected digraphs and graphs with small conditional diameters ⋮ Large \((d,D, D',s)\)-bipartite digraphs ⋮ Connectivity and fault-tolerance of hyperdigraphs ⋮ On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ On d-Fibonacci digraphs ⋮ The diameter of cyclic Kautz digraphs ⋮ Edge-connectivity and edge-superconnectivity in sequence graphs ⋮ Multipartite Moore digraphs ⋮ A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs ⋮ The line digraph of a regular and pancircular digraph is also regular and pancircular ⋮ Diameter vulnerability of iterated line digraphs ⋮ The spectra of subKautz and cyclic Kautz digraphs ⋮ Diameter-vulnerability of large bipartite digraphs ⋮ Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II ⋮ Large fault-tolerant interconnection networks ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ Digraphs on permutations ⋮ Connectivity of large bipartite digraphs and graphs ⋮ On the restricted arc-connectivity of \(s\)-geodetic digraphs ⋮ The spectra of some families of digraphs ⋮ Extensions of networks with given diameter ⋮ Bipartite graphs and digraphs with maximum connectivity ⋮ Queue layouts of iterated line directed graphs ⋮ Uniform homomorphisms of de Bruijn and Kautz networks ⋮ Sandpile groups and spanning trees of directed line graphs ⋮ Identifying codes in line digraphs ⋮ Super link-connectivity of iterated line digraphs. ⋮ Moore mixed graphs from Cayley graphs ⋮ Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing ⋮ Restricted arc-connectivity of generalized \(p\)-cycles ⋮ Diameter vulnerability of GC graphs ⋮ On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices ⋮ Automorphism groups of \(k\)-arc transitive covers. ⋮ Unnamed Item ⋮ Weakly distance-regular digraphs. ⋮ The diameter of cyclic Kautz digraphs ⋮ Zero forcing in iterated line digraphs ⋮ The degree-diameter problem for sparse graph classes ⋮ On the number of spanning trees and Eulerian tours in iterated line digraphs ⋮ The spectra of Manhattan street networks ⋮ Sequence mixed graphs ⋮ Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing ⋮ Connectivity of Kautz networks ⋮ Graphs on alphabets as models for large interconnection networks ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ The underlying graph of a line digraph ⋮ Independent spanning trees with small depths in iterated line digraphs ⋮ Diameter, short paths and superconnectivity in digraphs ⋮ Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays ⋮ Structural properties of subdivided-line graphs ⋮ On the structure of the adjacency matrix of the line digraph of a regular digraph ⋮ De Bruijn and Kautz digraphs of a rooted tree ⋮ On the unilateral (?,D*)-problem ⋮ On Moore bipartite digraphs ⋮ Kernels and partial line digraphs ⋮ The underlying line digraph structure of some (0, 1)-matrix equations ⋮ Super \(p\)-restricted edge connectivity of line graphs ⋮ Vertex-symmetric digraphs with small diameter ⋮ On large (Δ, D, D, 1)-graphs ⋮ A line digraph of a complete bipartite digraph ⋮ On the weak distance-regularity of Moore-type digraphs ⋮ On large vertex-symmetric digraphs ⋮ About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs ⋮ 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 ⋮ The \(k\)-restricted edge connectivity of undirected Kautz graphs ⋮ An algebraic approach to lifts of digraphs ⋮ On a problem of walks ⋮ On Cayley line digraphs ⋮ Miscellaneous Digraph Classes ⋮ Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs ⋮ Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism ⋮ Asymptotically large (\(\Delta,D\))-graphs ⋮ On the matrix equation \(A^l+A^{l+k}=J_n\) ⋮ On the acyclic disconnection and the girth ⋮ The superconnectivity of large digraphs and graphs ⋮ On the distance connectivity of graphs and digraphs ⋮ A Note on the Order of Iterated Line Digraphs
