On K*-ultrahomogeneous graphs

Daniel G. Isaksen; Chris Jankowski; Stephanie Proctor

On K*-ultrahomogeneous graphs

Daniel G. Isaksen, Chris Jankowski, Stephanie Proctor

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

7 Scopus citations

Abstract

Let ρ be any class of finite graphs. A graph G is ρ- ultrahomogeneous if every isomorphism between induced subgraphs belonging to ρ extends to an automorphism of G. We study finite graphs that are K*-ultrahomogeneous, where K* is the class of complete graphs. We also explicitly classify the finite graphs that are square cupK*- ultrahomogeneous, where square cupK* is the class of disjoint unions of complete graphs.

Original language	English
Pages (from-to)	83-96
Number of pages	14
Journal	Ars Combinatoria
Volume	82
State	Published - 1 Jan 2007
Externally published	Yes

ASJC Scopus subject areas

General Mathematics

Cite this

@article{80b820657d834eb3b3733235b6653cb5,

title = "On K*-ultrahomogeneous graphs",

abstract = "Let ρ be any class of finite graphs. A graph G is ρ- ultrahomogeneous if every isomorphism between induced subgraphs belonging to ρ extends to an automorphism of G. We study finite graphs that are K*-ultrahomogeneous, where K* is the class of complete graphs. We also explicitly classify the finite graphs that are square cupK*- ultrahomogeneous, where square cupK* is the class of disjoint unions of complete graphs.",

author = "Isaksen, {Daniel G.} and Chris Jankowski and Stephanie Proctor",

year = "2007",

month = jan,

day = "1",

language = "English",

volume = "82",

pages = "83--96",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - On K*-ultrahomogeneous graphs

AU - Isaksen, Daniel G.

AU - Jankowski, Chris

AU - Proctor, Stephanie

PY - 2007/1/1

Y1 - 2007/1/1

N2 - Let ρ be any class of finite graphs. A graph G is ρ- ultrahomogeneous if every isomorphism between induced subgraphs belonging to ρ extends to an automorphism of G. We study finite graphs that are K*-ultrahomogeneous, where K* is the class of complete graphs. We also explicitly classify the finite graphs that are square cupK*- ultrahomogeneous, where square cupK* is the class of disjoint unions of complete graphs.

AB - Let ρ be any class of finite graphs. A graph G is ρ- ultrahomogeneous if every isomorphism between induced subgraphs belonging to ρ extends to an automorphism of G. We study finite graphs that are K*-ultrahomogeneous, where K* is the class of complete graphs. We also explicitly classify the finite graphs that are square cupK*- ultrahomogeneous, where square cupK* is the class of disjoint unions of complete graphs.

UR - http://www.scopus.com/inward/record.url?scp=34047264469&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:34047264469

SN - 0381-7032

VL - 82

SP - 83

EP - 96

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

On K*-ultrahomogeneous graphs

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this