The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Optimal edge ranking of complete bipartite graphs in polynomial time”

Listing all plane graphs.

Yamanaka, Katsuhisa, Nakano, Shin-Ichi (2009)

Journal of Graph Algorithms and Applications

Similarity:

Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs

Yuefang Sun (2016)

Discussiones Mathematicae Graph Theory

Similarity:

The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |S| = k}, where λ(S) denote the maximum number ℓ of pairwise edge-disjoint trees T1, T2, . . . , Tℓ in G such that S ⊆ V (Ti) for 1 ≤ i ≤ ℓ. In this paper, we study the generalized edge- connectivity of product graphs and obtain sharp...