Pages that link to "Item:Q3309081"
From MaRDI portal
The following pages link to Line Digraph Iterations and the (d, k) Digraph Problem (Q3309081):
Displaying 50 items.
- Cospectral digraphs from locally line digraphs (Q272341) (← links)
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- Containment of butterflies in networks constructed by the line digraph operation (Q290188) (← links)
- The diameter of cyclic Kautz digraphs (Q322251) (← links)
- Restricted arc-connectivity of generalized \(p\)-cycles (Q423961) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Sequence mixed graphs (Q505431) (← links)
- Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing (Q510568) (← links)
- On the restricted arc-connectivity of \(s\)-geodetic digraphs (Q601919) (← links)
- Sandpile groups and spanning trees of directed line graphs (Q618292) (← links)
- On the number of spanning trees and Eulerian tours in iterated line digraphs (Q674922) (← links)
- Connectivity of Kautz networks (Q685656) (← links)
- Diameter, short paths and superconnectivity in digraphs (Q704288) (← links)
- Super \(p\)-restricted edge connectivity of line graphs (Q730960) (← links)
- Multipartite Moore digraphs (Q854866) (← links)
- The spectra of some families of digraphs (Q876309) (← links)
- Queue layouts of iterated line directed graphs (Q885285) (← links)
- The spectra of Manhattan street networks (Q947647) (← links)
- Kernels and partial line digraphs (Q990794) (← links)
- A line digraph of a complete bipartite digraph (Q1021880) (← links)
- On large vertex-symmetric digraphs (Q1024427) (← links)
- The \(k\)-restricted edge connectivity of undirected Kautz graphs (Q1044003) (← links)
- The line digraph of a regular and pancircular digraph is also regular and pancircular (Q1111564) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Extensions of networks with given diameter (Q1123211) (← links)
- Graphs on alphabets as models for large interconnection networks (Q1199426) (← links)
- Super edge-connectivity of dense digraphs and graphs (Q1199454) (← links)
- The underlying graph of a line digraph (Q1199455) (← links)
- Large generalized cycles (Q1281389) (← links)
- Superconnectivity of bipartite digraphs and graphs (Q1292813) (← links)
- Disjoint paths of bounded length in large generalized cycles (Q1292837) (← links)
- On the existence of \((d,k)\)-digraphs (Q1292845) (← links)
- On a problem of walks (Q1296149) (← links)
- Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs (Q1297626) (← links)
- On the matrix equation \(A^l+A^{l+k}=J_n\) (Q1307521) (← links)
- The superconnectivity of large digraphs and graphs (Q1313826) (← links)
- On the distance connectivity of graphs and digraphs (Q1322268) (← links)
- Connectivity and fault-tolerance of hyperdigraphs (Q1348372) (← links)
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs (Q1364476) (← links)
- Digraphs on permutations (Q1377815) (← links)
- Connectivity of large bipartite digraphs and graphs (Q1377820) (← links)
- Uniform homomorphisms of de Bruijn and Kautz networks (Q1392540) (← links)
- Super link-connectivity of iterated line digraphs. (Q1401417) (← links)
- Diameter vulnerability of GC graphs (Q1408451) (← links)
- Automorphism groups of \(k\)-arc transitive covers. (Q1422432) (← links)
- Weakly distance-regular digraphs. (Q1426099) (← links)
- On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices (Q1713317) (← links)
- Zero forcing in iterated line digraphs (Q1727740) (← links)
- De Bruijn and Kautz digraphs of a rooted tree (Q1779501) (← links)
- Vertex-symmetric digraphs with small diameter (Q1805459) (← links)
