Line Digraph Iterations and the (d, k) Digraph Problem
From MaRDI portal
Publication:3309081
DOI10.1109/TC.1984.1676455zbMath0528.68048MaRDI QIDQ3309081
J. Luis A. Yebra, Miquel Àngel Fiol, Ignacio Alegre de Miquel
Publication date: 1984
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
94C15: Applications of graph theory to circuits and networks
Related Items
Unnamed Item, On Moore bipartite digraphs, Partial line directed hypergraphs, Superconnected digraphs and graphs with small conditional diameters, 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 number of spanning trees and Eulerian tours in iterated line digraphs, Connectivity of Kautz networks, Diameter, short paths and superconnectivity in digraphs, Multipartite Moore digraphs, The spectra of some families of digraphs, Queue layouts of iterated line directed graphs, The spectra of Manhattan street networks, 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., 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, Edge-connectivity and edge-superconnectivity in sequence graphs, On the structure of the adjacency matrix of the line digraph of a regular digraph, Asymptotically large (\(\Delta,D\))-graphs
