Title
Pairs Of Maximal "Almost" Disjoint Isomorphic Subgraphs Of Spiders
Abbreviated Journal Title
Util. Math.
Keywords
FACTORIZATIONS; Mathematics, Applied; Statistics & Probability
Abstract
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.
Journal Title
Utilitas Mathematica
Volume
52
Publication Date
1-1-1997
Document Type
Article
Language
English
First Page
161
Last Page
172
WOS Identifier
ISSN
0315-3681
Recommended Citation
"Pairs Of Maximal "Almost" Disjoint Isomorphic Subgraphs Of Spiders" (1997). Faculty Bibliography 1990s. 1869.
https://stars.library.ucf.edu/facultybib1990/1869
COinS
Comments
Authors: contact us about adding a copy of your work at STARS@ucf.edu