Adamaszek, Anna and Adamaszek, Michał (2011) Uniqueness of graph square roots of girth six. The Electronic Journal of Combinatorics, Vol.18 (No.1). P139 .

Preview

PDF WRAP_Adamaszek_Uniqueness_graph_square.pdf - Published Version - Requires a PDF viewer. Download (133Kb)

Request Changes to record.

Abstract

We prove that if two graphs of girth atleast 6 have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of girth at least 7. We also make a remark on reconstruction of graphs from their higher powers.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science > Computer Science Faculty of Science > Mathematics
Library of Congress Subject Headings (LCSH):	Graph theory, Isomorphisms (Mathematics)
Journal or Publication Title:	The Electronic Journal of Combinatorics
Publisher:	Electronic Journal of Combinatorics
ISSN:	2150-959X
Official Date:	1 July 2011
Dates:	Date Event 1 July 2011 Published
Date of first compliant deposit:	18 December 2015
Date of first compliant Open Access:	18 December 2015
Volume:	Vol.18
Number:	No.1
Page Range:	P139
Status:	Peer Reviewed
Publication Status:	Published
Funder:	Engineering and Physical Sciences Research Council (EPSRC)
Grant number:	EP/D063191/1 (EPSRC)

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads