Pages that link to "Item:Q3309081"
From MaRDI portal
The following pages link to Line Digraph Iterations and the (d, k) Digraph Problem (Q3309081):
Displayed 35 items.
- On Cayley line digraphs (Q1842155) (← links)
- Large \((d,D, D',s)\)-bipartite digraphs (Q1891920) (← links)
- Diameter vulnerability of iterated line digraphs (Q1910577) (← links)
- Diameter-vulnerability of large bipartite digraphs (Q1917252) (← links)
- Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II (Q1917254) (← links)
- Bipartite graphs and digraphs with maximum connectivity (Q1923586) (← links)
- Structural properties of subdivided-line graphs (Q2018541) (← links)
- Identifying codes in line digraphs (Q2189840) (← links)
- About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs (Q2312064) (← links)
- An algebraic approach to lifts of digraphs (Q2328094) (← links)
- On the acyclic disconnection and the girth (Q2345594) (← links)
- Iterated line digraphs are asymptotically dense (Q2361568) (← links)
- On the \(k\)-tuple domination of de Bruijn and Kautz digraphs (Q2380002) (← links)
- Edge-connectivity and edge-superconnectivity in sequence graphs (Q2384389) (← links)
- The spectra of subKautz and cyclic Kautz digraphs (Q2402448) (← links)
- On the structure of the adjacency matrix of the line digraph of a regular digraph (Q2499597) (← links)
- Asymptotically large (\(\Delta,D\))-graphs (Q2576342) (← links)
- On large (Δ, D, D, 1)-graphs (Q3087616) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- (Q3391331) (← links)
- On Moore bipartite digraphs (Q4416302) (← links)
- On the unilateral (?,D*)-problem (Q4520240) (← links)
- Partial line directed hypergraphs (Q4537610) (← links)
- Superconnected digraphs and graphs with small conditional diameters (Q4537622) (← links)
- Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism (Q5006547) (← links)
- The diameter of cyclic Kautz digraphs (Q5023118) (← links)
- On d-Fibonacci digraphs (Q5061708) (← links)
- A Note on the Order of Iterated Line Digraphs (Q5272924) (← links)
- On the super‐restricted arc‐connectivity of <i>s</i> ‐geodetic digraphs (Q5326776) (← links)
- On the weak distance-regularity of Moore-type digraphs (Q5478713) (← links)
- Independent spanning trees with small depths in iterated line digraphs (Q5936460) (← links)
- Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays (Q5941511) (← links)
- The underlying line digraph structure of some (0, 1)-matrix equations (Q5957359) (← links)
- Moore mixed graphs from Cayley graphs (Q6164662) (← links)
- Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing (Q6180036) (← links)