Skip navigation
Skip navigation

Switching Reconstruction of Digraphs

McKay, Brendan; Schweitzer, Pascal

Description

Switching about a vertex in a digraph means to reverse the direction of every edge incident with that vertex. Bondy and Mercier introduced the problem of whether a digraph can be reconstructed up to isomorphism from the multiset of isomorphism types of digraphs obtained by switching about each vertex. Since the largest known nonreconstructible oriented graphs have eight vertices, it is natural to ask whether there are any larger nonreconstructible graphs. In this article, we continue the...[Show more]

CollectionsANU Research Publications
Date published: 2013
Type: Journal article
URI: http://hdl.handle.net/1885/66233
Source: Journal of Graph Theory
DOI: 10.1002/jgt.21765

Download

File Description SizeFormat Image
01_McKay_Switching_Reconstruction_of_2013.pdf1.19 MBAdobe PDF    Request a copy


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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator