Reconstruction from vertex-switching

DOI10.1016/0095-8956(85)90078-4zbMath0572.05046OpenAlexW2117153694MaRDI QIDQ1062077

Richard P. Stanley

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90078-4

zbMATH Keywords

vertex-switching reconstruction problem

Mathematics Subject Classification ID

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

Related Items (14)

Balance equations for reconstruction problems ⋮ Reconstructing graphs from their k-edge deleted subgraphs ⋮ Finite-type invariants for graphs and graph reconstructions ⋮ Degree conditions for vertex switching reconstruction ⋮ Vertex-switching reconstruction of subgraph numbers and triangle-free graphs ⋮ Switching reconstruction and diophantine equations ⋮ Многочлены Кравчука и их применения в задачах криптографии и теории кодирования ⋮ On switching classes of graphs ⋮ An Ore-type condition for cyclability ⋮ The \(r\)-switching-stable graphs ⋮ Integer zeros of \(q\)-Krawtchouk polynomials in classical combinatorics ⋮ Switching reconstruction of digraphs ⋮ Self Vertex Switching of Connected Two-Cyclic Graphs ⋮ Switching Reconstruction of Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quotients of Peck posets
• The Radon transform on \({\mathbb{Z}}^ k_ 2\)
• A note on the line reconstruction problem
• Graph reconstruction—a survey
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number

This page was built for publication: Reconstruction from vertex-switching