Title
Pairs of maximal "almost" disjoint isomorphic subgraphs of spiders
Abstract
It is possible to partition the vertices of any spider into three sets R, B, and C such that the subgraph induced by R ∪ C is isomorphic to the subgraph induced by B ∪ C and, among all such partitions, |C| is minimum. The quantity |R| = |B| in such a partition is a graphical invariant, and its value is determined for all spiders.
Publication Date
12-1-1997
Publication Title
Utilitas Mathematica
Volume
52
Number of Pages
161-172
Document Type
Article
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
0031460989 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/0031460989
STARS Citation
Brigham, Robert C. and Dutton, Ronald D., "Pairs of maximal "almost" disjoint isomorphic subgraphs of spiders" (1997). Scopus Export 1990s. 3073.
https://stars.library.ucf.edu/scopus1990/3073