Pages that link to "Item:Q704288"

The following pages link to Diameter, short paths and superconnectivity in digraphs (Q704288):

Displaying 7 items.

• Distance formula and shortest paths for the \((n,k)\)-star graphs (Q975861) (← links)
• Sufficient conditions for super-arc-strongly connected oriented graphs (Q1015435) (← links)
• On the \(k\)-tuple domination of de Bruijn and Kautz digraphs (Q2380002) (← links)
• The number of shortest paths in the (n, k)-star graph (Q2931914) (← links)
• Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors (Q3005114) (← links)
• Connectedness of digraphs and graphs under constraints on the conditional diameter (Q4667716) (← links)
• On the super‐restricted arc‐connectivity of <i>s</i> ‐geodetic digraphs (Q5326776) (← links)