๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Greatest common divisors and least common multiples of graphs

โœ Scribed by G. Chartrand; L. Holley; G. Kubicki; M. Schultz

Publisher
Springer Netherlands
Year
1993
Tongue
English
Weight
492 KB
Volume
27
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Principal Common Divisors of Graphs
Principal Common Divisors of Graphs
โœ Gary Chartrand; Wayne Goddard; Michael A. Henning; Farrokh Saba; Henda C. Swart ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 261 KB

A graph \(H\) divides a graph \(G\), written \(H \mid G\), if \(G\) is \(H\)-decomposable. If \(H \neq G\), then \(H\) properly divides \(G\). A graph \(G\) is a principal common divisor if there exist graphs \(G_{1}\) and \(G_{2}\) such that \(G\) properly divides \(G_{1}\) and \(G_{2}\), and if \(