On transitive decompositions of disconnected graphs

G. Pearce

doi:10.1016/j.disc.2008.10.022

On transitive decompositions of disconnected graphs

G. Pearce

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

Abstract

We investigate transitive decompositions of disconnected graphs, and show that these behave very differently from a related class of algebraic graph decompositions, known as homogeneous factorisations. We conclude that although the study of homogeneous factorisations admits a natural reduction to those cases where the graph is connected, the study of transitive decompositions does not.

Original language	English
Pages (from-to)	3774-3778
Journal	Discrete Mathematics
Volume	309
Issue number	12
DOIs	https://doi.org/10.1016/j.disc.2008.10.022
Publication status	Published - 2009

Access to Document

10.1016/j.disc.2008.10.022

Cite this

@article{b418821555d74776a849aa4ddda04d1a,

title = "On transitive decompositions of disconnected graphs",

abstract = "We investigate transitive decompositions of disconnected graphs, and show that these behave very differently from a related class of algebraic graph decompositions, known as homogeneous factorisations. We conclude that although the study of homogeneous factorisations admits a natural reduction to those cases where the graph is connected, the study of transitive decompositions does not.",

author = "G. Pearce",

year = "2009",

doi = "10.1016/j.disc.2008.10.022",

language = "English",

volume = "309",

pages = "3774--3778",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "12",

}

TY - JOUR

T1 - On transitive decompositions of disconnected graphs

AU - Pearce, G.

PY - 2009

Y1 - 2009

N2 - We investigate transitive decompositions of disconnected graphs, and show that these behave very differently from a related class of algebraic graph decompositions, known as homogeneous factorisations. We conclude that although the study of homogeneous factorisations admits a natural reduction to those cases where the graph is connected, the study of transitive decompositions does not.

AB - We investigate transitive decompositions of disconnected graphs, and show that these behave very differently from a related class of algebraic graph decompositions, known as homogeneous factorisations. We conclude that although the study of homogeneous factorisations admits a natural reduction to those cases where the graph is connected, the study of transitive decompositions does not.

U2 - 10.1016/j.disc.2008.10.022

DO - 10.1016/j.disc.2008.10.022

M3 - Article

VL - 309

SP - 3774

EP - 3778

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 12

ER -

On transitive decompositions of disconnected graphs

Abstract

Access to Document

Fingerprint

Cite this