Pairs Of Maximal "Almost" Disjoint Isomorphic Subgraphs Of Spiders
Abbreviated Journal Title
FACTORIZATIONS; Mathematics, Applied; Statistics & Probability
It is possible to partition the vertices of any spider into three sets R, B, and C such that the subgraph induced by RUC is isomorphic to the subgraph induced by B boolean OR C and, among all such partitions, \C\ is minimum. The quantity \R\ = \B\ in such partition is a graphical invariant, and its value is determined for all spiders.
"Pairs Of Maximal "Almost" Disjoint Isomorphic Subgraphs Of Spiders" (1997). Faculty Bibliography 1990s. 1869.