Principal common divisors of graphs

Gary Chartrand; Wayne Goddard; Michael A. Henning; Farrokh Saba; Henda C. Swart

doi:10.1006/eujc.1993.1012

Principal common divisors of graphs

Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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 G₁ and G₂ such that G properly divides G₁ and G₂, and if H is any graph such that H | G₁ and H | G₂, then H | G. Several graphs that are principal common divisors are described. It is shown that complete graphs are not principal common divisors.

Original language	English
Pages (from-to)	85-93
Number of pages	9
Journal	European Journal of Combinatorics
Volume	14
Issue number	2
DOIs	https://doi.org/10.1006/eujc.1993.1012
Publication status	Published - Mar 1993
Externally published	Yes

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1006/eujc.1993.1012

Cite this

@article{45904a941f424d3d810e54ea948e7925,

title = "Principal common divisors of graphs",

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.",

author = "Gary Chartrand and Wayne Goddard and Henning, \{Michael A.\} and Farrokh Saba and Swart, \{Henda C.\}",

year = "1993",

month = mar,

doi = "10.1006/eujc.1993.1012",

language = "English",

volume = "14",

pages = "85--93",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

number = "2",

}

TY - JOUR

T1 - Principal common divisors of graphs

AU - Chartrand, Gary

AU - Goddard, Wayne

AU - Henning, Michael A.

AU - Saba, Farrokh

AU - Swart, Henda C.

PY - 1993/3

Y1 - 1993/3

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/38249007415

U2 - 10.1006/eujc.1993.1012

DO - 10.1006/eujc.1993.1012

M3 - Article

AN - SCOPUS:38249007415

SN - 0195-6698

VL - 14

SP - 85

EP - 93

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 2

ER -

Principal common divisors of graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this