Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/3329
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Krasikov, I | - |
dc.coverage.spatial | 9 | en |
dc.date.accessioned | 2009-05-22T11:37:22Z | - |
dc.date.available | 2009-05-22T11:37:22Z | - |
dc.date.issued | 1994 | - |
dc.identifier.citation | Journal of Graph Theory. 18 (3) 217-225 | en |
dc.identifier.other | DOI:10.1002/jgt.3190180302 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/3329 | - |
dc.description.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 - 2)/2-VSR and n/2-VSR if n = 2(mod 4), (n - 1)/2-VSR if n = 1 (mod 2). For hypothetical nonreconstructible graphs, we give bounds on the number of edges (for any s) and on the maximum and minimum degree (for s = 2). We also show that for n > 9 the degree sequence is 2-VSR. | en |
dc.format.extent | 174 bytes | - |
dc.format.mimetype | text/plain | - |
dc.language.iso | en | - |
dc.publisher | Wiley | en |
dc.title | Applications of balance equations to vertex switching reconstruction | en |
dc.type | Research Paper | en |
Appears in Collections: | Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Article_info.txt | 174 B | Text | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.