Pairs of maximal "almost" disjoint isomorphic subgraphs of spiders

Authors

  • Brigham, Robert C.
  • Dutton, Ronald D.

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.

Published

1997-06-09

How to Cite

Brigham, Robert C., & Dutton, Ronald D. (1997). Pairs of maximal "almost" disjoint isomorphic subgraphs of spiders. Utilitas Mathematica, 52. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/39

Issue

Vol. 52 (1997): Volume 52, 1997

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.