Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/3329
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKrasikov, I-
dc.coverage.spatial9en
dc.date.accessioned2009-05-22T11:37:22Z-
dc.date.available2009-05-22T11:37:22Z-
dc.date.issued1994-
dc.identifier.citationJournal of Graph Theory. 18 (3) 217-225en
dc.identifier.otherDOI:10.1002/jgt.3190180302-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/3329-
dc.description.abstractA 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.extent174 bytes-
dc.format.mimetypetext/plain-
dc.language.isoen-
dc.publisherWileyen
dc.titleApplications of balance equations to vertex switching reconstructionen
dc.typeResearch Paperen
Appears in Collections:Mathematical Sciences

Files in This Item:
File Description SizeFormat 
Article_info.txt174 BTextView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.