On the 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;ne zaključna dela;mathematics;graph theory;reconstruction problem;strong product;composite graphs;

Data

Language:	English
Year of publishing:	2003
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	UM FS - Faculty of Mechanical Engineering
UDC:	519.17
COBISS:	13825625
ISSN:	1571-0653
Views:	31
Downloads:	20
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	Unknown
Secondary title:	Šibka rekonstrukcija krepkega produkta grafov
Secondary keywords:	Teorija grafov;
URN:	URN:SI:UM:
Type (COBISS):	Not categorized
Pages:	str. 123-127
Issue:	ǂVol. ǂ13
Chronology:	April 2003
DOI:	10.1016/S1571-0653(04)00452-4
ID:	1472587