Homogeneous embeddings of cycles in graphs
type: Item
instance of: scholarly article
title: Homogeneous embeddings of cycles in graphs
zbMATH Open document ID: 0933.05084
author: Wayne Goddard
author: Michael A. Henning
author: Hiren Maharaj
published in: Graphs and Combinatorics
publication date: 1999-11-22T00:00:00Z
review text: If \(G\) and \(H\) are vertex-transitive graphs, then the framing number \(\text{fr}(G, H)\) of \(G\) and \(H\) is defined as the minimum order of a graph every vertex of which belongs to an induced \(G\) and an induced \(H\). This paper investigates \(\text{fr}(C_m, C_n)\) for \(m < n\). The authors show first that \(\text{fr}(C_m, C_n) \geq n + 2\) and determine when equality occurs. Thereafter they establish general lower and upper bounds which show that \(\text{fr}(C_m, C_n)\) is approximately the minimum of \(n - m + 2\sqrt{n}\) and \(n + \frac{n}{m}\).
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1332849
zbMATH Keywords: graph
zbMATH Keywords: framing number
zbMATH Keywords: cycle
zbMATH Keywords: homogeneous embedding
reviewed by: Stanislav Jendroľ
MaRDI profile type: MaRDI publication profile
full work available at URL: s003730050050
OpenAlex ID: W2032107382
DOI: 10.1007/S003730050050
Recommended article: Q4853741
Recommended article: Q4349631
Recommended article: Frames of cycles and directed cycles
Recommended article: SOME GENERAL ASPECTS OF THE FRAMING NUMBER OF A GRAPH
Recommended article: Q4849047
description: scientific article; zbMATH DE number 1332849