Weak reconstruction of strong product graphs

Blaž Zmazek (Author), Janez Žerovnik (Author)

Abstract

We prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs.

Keywords

matematika;teorija grafov;problem rekonstrukcije;šibka rekonstrukcija;krepki produkt grafov;mathematics;graph theory;reconstruction problem;strong product;composite graphs;

Data

Language:	English
Year of publishing:	2007
Typology:	1.01 - Original Scientific Article
Organization:	UM FS - Faculty of Mechanical Engineering
UDC:	519.17
COBISS:	14184025
ISSN:	0012-365X
Views:	32
Downloads:	20
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	Unknown
Secondary title:	Šibka rekonstrukcija krepkega produkta grafov
URN:	URN:SI:UM:
Type (COBISS):	Not categorized
Pages:	str. 641-649
Volume:	ǂVol. ǂ307
Issue:	ǂiss. ǂ3-5
Chronology:	2007
ID:	1472919