Title of article
Principal Common Divisors of Graphs
Author/Authors
Chartrand، نويسنده , , Gary and Goddard، نويسنده , , Wayne and Henning، نويسنده , , Michael A. and Saba، نويسنده , , Farrokh and Swart، نويسنده , , Henda C. Swart، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1993
Pages
9
From page
85
To page
93
Abstract
A graph H divides a graph G, written H | G , if G is H-decomposable. If H ≠ G, then H properly divides G. A graph G is a principal common divisor if there exist graphs G1 and G2 such that G properly divides G1 and G2 , and if H is any graph such that H | G1 and H | G2, then H | G. Several graphs that are principal common divisors are described. It is shown that complete graphs are not principal common divisors.
Journal title
European Journal of Combinatorics
Serial Year
1993
Journal title
European Journal of Combinatorics
Record number
1546745
Link To Document