A vertex-cut S is called a super vertex-cut if G− S is disconnected and it contains no isolated
vertices. The super-connectivity, κ′, is the minimum cardinality over all super vertex-cuts …

Let G 1 and G 2 be two graphs. The Kronecker product G 1× G 2 has vertex set V (G 1× G
2)= V (G 1)× V (G 2) and the edge set E (G 1× G 2)={(u 1, v 1)(u 2, v 2)∣ u 1 u 2∈ E (G 1), v …

The modified bubble-sort graph $ MB_n $$(n\geq 2) $ has been known as a topology
structure of interconnection networks‎.‎ In this paper‎,‎ we propose simple method for arc …

Full article: Under which conditions is λ″(G)=κ″(L(G))? Skip to Main Content Taylor and
Francis Online homepage Browse Search Publish Login | Register Log in or Register Login …

Let G be a graph. A vertex-cut S of G is said to be k-restricted if every component of G− S has
at least k vertices, and cyclic if G− S has at least two components which contain a cycle. The …

SOME RESULTS ON DIRECT PRODUCT GRAPHS 1 Introduction Page 1 SOME RESULTS
ON DIRECT PRODUCT GRAPHS Zeinab Ghasemi1 Department of Mathematics, Khoy …