Vertex-switching reconstruction of subgraph numbers and triangle-free graphs
type: Item
instance of: scholarly article
title: Vertex-switching reconstruction of subgraph numbers and triangle-free graphs
zbMATH Open document ID: 0695.05053
DOI: 10.1016/0095-8956(92)90048-3
published in: Journal of Combinatorial Theory. Series B
publication date: 1992-01-01T00:00:00Z
review text: Let G be a graph with n vertices, and let S be a graph with k vertices, \(k<n/2\). Algebraic techniques are used to prove that the number of induced subgraphs (or just subgraphs) of G isomorphic to S is vertex- switching reconstructible. This vertex-switching version of Kelly's Lemma is used, along with structural arguments, to prove that triangle-free graphs are vertex-switching reconstructible.
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 4137815
zbMATH Keywords: vertex-switching reconstruction
zbMATH Keywords: disconnected graphs
zbMATH Keywords: triangle-free graphs
author: M. N. Ellingham
author: Gordon Royle
MaRDI profile type: Publication
full work available at URL: 0095-8956(92)90048-3
OpenAlex ID: W2060315338
cites work: Graph reconstruction—a survey
cites work: Q3992965
cites work: Q4871779
cites work: Reconstructing graphs from their k-edge deleted subgraphs
cites work: A note on the vertex-switching reconstruction
cites work: Balance equations for reconstruction problems
cites work: Switching reconstruction and diophantine equations
cites work: Reconstruction from vertex-switching
description: scientific article; zbMATH DE number 4137815