𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degree conditions for vertex switching reconstruction

✍ Scribed by I. Krasikov

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
185 KB
Volume
160
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

More on Vertex-Switching Reconstruction
More on Vertex-Switching Reconstruction
✍ I. Krasikov; Y. Roditty πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 596 KB

A graph is called \(s\)-vertex switching reconstructible ( \(s\)-VSR) if it is uniquely defined, up to isomorphism by the multiset of unlabeled graphs obtained by switching of all its \(s\)-vertex subsets. Stanley proved that a graph with \(n\) vertices is \(s\)-VSR if the Krawtchouk polynomial \(P_

Vertex-Switching Reconstruction and Fold
Vertex-Switching Reconstruction and Folded Cubes
✍ M.N. Ellingham πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 216 KB

In this note we use eigenvalues of folded cubes to simplify an analogue of Kelly's Lemma for vertex-switching reconstruction due to Krasikov and Roditty. Our new version states that the number of subgraphs (or induced subgraphs) of an n-vertex graph G isomorphic to a given m-vertex graph can be foun

Applications of balance equations to ver
Applications of balance equations to vertex switching reconstruction
✍ I. Krasikov πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 404 KB πŸ‘ 1 views

## Abstract A graph is called __s‐vertex switching reconstructible__ (__s__‐VSR) if it is uniquely defined, up to isomorphism, by the multiset of unlabeled graphs obtained by switching of all its __s__‐vertex subsets. We show that a graph with __n__ vertices is __n__/2‐VSR if __n__ = 0(mod 4), (__n

Reconstructing degree sequences from k-v
Reconstructing degree sequences from k-vertex-deleted subgraphs
✍ Richard Taylor πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 362 KB

Let k 23 be an integer. We show that the degree sequences of all sufficiently large graphs are determined by their k-vertex-deleted subgraphs. In particular, this is shown for all graphs on at least f(k) vertices, where f(k) IS a certain function which is asymptotic to ke.