Pages that link to "Item:Q5167713"

The following pages link to The generalized 3-connectivity of Lexicographic product graphs (Q5167713):

Displaying 23 items.

• Graphs with large generalized (edge-)connectivity (Q339485) (← links)
• Tree connectivities of Cayley graphs on abelian groups with small degrees (Q503543) (← links)
• A solution to a conjecture on the generalized connectivity of graphs (Q512887) (← links)
• On the difference of two generalized connectivities of a graph (Q512888) (← links)
• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) (← links)
• On two generalized connectivities of graphs (Q1692646) (← links)
• A result on the 3-generalized connectivity of a graph and its line graph (Q1714044) (← links)
• The generalized 3-connectivity of graph products (Q1734731) (← links)
• Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072) (← links)
• The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants (Q2007586) (← links)
• Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (Q2082190) (← links)
• Path 3-(edge-)connectivity of lexicographic product graphs (Q2185739) (← links)
• The 4-set tree connectivity of \((n, k)\)-star networks (Q2205941) (← links)
• The reliability analysis based on the generalized connectivity in balanced hypercubes (Q2223684) (← links)
• The minimum size of a graph with given tree connectivity (Q2227103) (← links)
• Two lower bounds for generalized 3-connectivity of Cartesian product graphs (Q2335758) (← links)
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (Q2341720) (← links)
• On the maximum and minimum sizes of a graph with given \(k\)-connectivity (Q2364084) (← links)
• A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs (Q2409788) (← links)
• Structural Properties of Generalized Exchanged Hypercubes (Q4686651) (← links)
• On extremal graphs with exactly one Steiner tree connecting any $k$ vertices (Q5374223) (← links)
• Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks (Q5374226) (← links)
• A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs (Q5878427) (← links)