Pages that link to "Item:Q3663185"

The following pages link to A Design for Directed Graphs with Minimum Diameter (Q3663185):

Displaying 49 items.

• Vertex in-magic arc labelings of digraphs (Q324904) (← links)
• \(E\)-super vertex in-magic total labelings of digraphs (Q324924) (← links)
• The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks (Q418321) (← links)
• Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields (Q468704) (← links)
• On the decycling number of generalized Kautz digraphs (Q477628) (← links)
• Efficient twin domination in generalized de Bruijn digraphs (Q482195) (← links)
• Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications (Q517716) (← links)
• A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants (Q617857) (← links)
• On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs (Q621581) (← links)
• On the number of spanning trees and Eulerian tours in iterated line digraphs (Q674922) (← links)
• Connectivity of Kautz networks (Q685656) (← links)
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs (Q1007577) (← links)
• Reinforcement numbers of digraphs (Q1026162) (← links)
• Sufficient conditions for maximally connected dense graphs (Q1086585) (← links)
• Large fault-tolerant interconnection networks (Q1120553) (← links)
• The Hamiltonian property of generalized de Bruijn digraphs (Q1179462) (← links)
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs (Q1182967) (← links)
• Connectivity of consecutive-\(d\) digraphs (Q1199422) (← links)
• Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs (Q1199445) (← links)
• Super edge-connectivity of dense digraphs and graphs (Q1199454) (← links)
• An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph (Q1210232) (← links)
• Large generalized cycles (Q1281389) (← links)
• Disjoint paths of bounded length in large generalized cycles (Q1292837) (← links)
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs (Q1297626) (← links)
• The Hamiltonian property of consecutive-\(d\) digraphs (Q1310230) (← links)
• Counting closed walks in generalized de Bruijn graphs (Q1318762) (← links)
• Connectivity and fault-tolerance of hyperdigraphs (Q1348372) (← links)
• The Hamiltonian property of the consecutive-3 digraphs (Q1368420) (← links)
• Super line-connectivity of consecutive-\(d\) digraphs (Q1382814) (← links)
• Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks (Q1392538) (← links)
• Super link-connectivity of iterated line digraphs. (Q1401417) (← links)
• Efficient absorbants in generalized de Bruijn digraphs (Q1751232) (← links)
• The Hamiltonian property of linear functions (Q1820790) (← links)
• Superfluous edges and exponential expansions of de Bruijn and Kautz graphs (Q1827806) (← links)
• On the number of cycles in generalized Kautz digraphs (Q1877656) (← links)
• IEH graphs. A novel generalization of hypercube graphs (Q1902299) (← links)
• Extension of de Bruijn graph and Kautz graph (Q1903209) (← links)
• Diameter vulnerability of iterated line digraphs (Q1910577) (← links)
• Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II (Q1917254) (← links)
• On the \(k\)-tuple domination of de Bruijn and Kautz digraphs (Q2380002) (← links)
• Bounds on the absorbant number of generalized Kautz digraphs (Q3014581) (← links)
• Twin domination in generalized Kautz digraphs (Q3014589) (← links)
• Miscellaneous Digraph Classes (Q3120443) (← links)
• Partial line directed hypergraphs (Q4537610) (← links)
• New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
• On efficient absorbant conjecture in generalized De Bruijn digraphs (Q4976295) (← links)
• An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
• Power domination in generalized undirected de Bruijn graphs and Kautz graphs (Q5245856) (← links)
• The underlying line digraph structure of some (0, 1)-matrix equations (Q5957359) (← links)