Connected graphs containing a given connected graph as a unique greatest common subgraph |
| |
| Authors: | Gary Chartrand Mark Johnson Ortrud R Oellermann |
| |
| Institution: | (1) Computational Chemistry Support, The Upjohn Company, 49001 Kalamazoo, MI, USA;(2) Department of Mathematics, Western Michigan University, 40098 Kalamazoo, MI, USA |
| |
| Abstract: | Those connected graphsG are determined for which there exist nonisomorphic connected graphs of equal size containingG as a unique greatest common subgraph. Analogous results are also obtained for weakly connected and strongly connected digraphs, as well as for induced subgraphs and induced subdigraphs.This research was supported by a Western Michigan University faculty research fellowship.This research was supported in part by a Western Michigan University research assistantship from the Graduate College and the College of Arts and Sciences. |
| |
| Keywords: | Primary 05C99 Secondary 05C40 05C20 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
