Brick partitions of graphs
نویسندگان
چکیده
For each rational number q ≥ 1, we describe two partitions of the vertex set of a graph G, called the q-brick partition and the q-superbrick partition. The special cases when q = 1 are the partitions given by the connected components and the 2-edge-connected components of G, respectively. We obtain structural results on these partitions and describe their relationship to the principal partitions of a matroid.
منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملNumerical Investigation on the Progressive Collapse Resistance of an RC Building with Brick Infills under Column Loss
Interior brick-infill partitions are usually considered as non-structural components and only their weight is accounted for in practical structural design. In this study, their effect on the progressive collapse resistance of an RC building subjected to sudden column loss is investigated. Three notional column loss conditions with four different brick-infill locations are considered. Column-los...
متن کاملRemovable Edges in Near-bricks
For a brick apart from a few small graphs, Lovász (1987) proposed a conjecture on the existence of an edge whose deletion results in a graph with only one brick in its tight cut decomposition. Carvalho, Lucchesi, and Murty (2002) confirmed this conjecture by showing the existence of such two edges. This paper generalizes the result obtained by Carvalho et al. to the case of irreducible near-bri...
متن کاملBrick Generation
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching decomposition procedure of Kotzig, and Lovász and Plummer. We prove that every brick except for the Petersen graph can be reduced to K4 or the prism by repeatedly applying a ce...
متن کاملBrick Generation and Conformal Subgraphs
A nontrivial connected graph is matching covered if each of its edges lies in a perfect matching. Two types of decompositions of matching covered graphs, namely ear decompositions and tight cut decompositions, have played key roles in the theory of these graphs. Any tight cut decomposition of a matching covered graph results in an essentially unique list of special matching covered graphs, call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010