Abstract
We introduce and investigate the notion of p-connectedness. As it turns out, this concepts leads naturally to a unique tree representation for arbitrary graphs: the leaves of this tree are the p-connected components along with weak vertices, that is, vertices of the graph that belong to no p-connected component. By refining this first result, we obtain a new decomposition for arbitrary graphs that generalizes the well-known modular decomposition….
Cite
CITATION STYLE
Jamison, B., & Olariu, S. (1993). On the homogeneous decomposition of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 657 LNCS, pp. 170–183). Springer Verlag. https://doi.org/10.1007/3-540-56402-0_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
