The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Sufficient Conditions for λ3-Optimality of Triangle-Free Graphs
Author(s): 
Pages: 25-31
Year: Issue:  4
Journal: Operations Research Transactions

Keyword:  Operations researchrestricted-edge-connectivity3-restricted-edge con-nectivitytriangle-free;
Abstract: Let G=(V,E)be a connected graph.An edge set S C E iS a 3-restrictededge-cut,if G-S is disconnected and every component of G-S has at least three vertices.The 3-restricted-edge-connectivity λ3 (G)of G is the cardinality of a minimum 3-restricted-edge-cut of G.A graph G is λ3-connected,if 3-restricted-edge-cuts exist.A graph G is called λ3-optimal,if λ3(G)=ξ3(G),whereξ 3(G)=min{|[U, ̄U]|:∪ C V,|U| =3 and G[U]is connected}.G[U] is the subgraph of G induced by the vertex subset U C_ V,and U=V\U is the complement of U.[U, ̄U] is the set of edges with one end in U and the other in U.In this paper,we give some sufficient conditions for triangle-free graphs to be λ3-optimal.
Related Articles
No related articles found