A note on the vertex-switching reconstruction

DOI10.1155/S0161171288001012MaRDI QIDQ1114710zbMATH OpenOpenAlexFDO

Authors Ilia Krasikov

Publication date 1988

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/46339

zbMATH Keywords

vertex-switching reconstruction

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Review text

The author investigates the vertex-switching reconstruction problem, which was proposed by \textit{R. P. Stanley} [J. Comb. Theory, Ser. B 38, 132-138 (1985; Zbl 0572.05046)]. It is shown that any disconnected graph with at least five vertices is reconstructible. In addition, reconstructibility is established for graphs having a vertex of degree ``not close to n/2.

Recommendations

• Switching reconstruction and diophantine equations
• Graph reconstruction -- some new developments
• Switching reconstruction of digraphs
• Reconstruction from vertex-switching
• More on vertex-switching reconstruction

Cited in

(9)

• Reconstruction from vertex-switching
• Balance equations for reconstruction problems
• Degree conditions for vertex switching reconstruction
• scientific article; zbMATH DE number 6496937 (Why is no real title available?)
• Discrete Fourier Calculus and Graph Reconstruction
• Switching reconstruction of digraphs
• Switching reconstruction of digraphs
• Vertex-switching reconstruction of subgraph numbers and triangle-free graphs
• Switching reconstruction and diophantine equations

This page was built for publication: A note on the vertex-switching reconstruction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114710)