| Title: | On the weak reconstruction of strong product graphs |
|---|
| Authors: | ID Zmazek, Blaž (Author)
ID Žerovnik, Janez (Author) |
|---|
| Files: |  http://dx.doi.org/10.1016/S1571-0653(04)00452-4
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.08 - Published Scientific Conference Contribution |
|---|
| Organization: | PEF - Faculty of Education
|
|---|
| 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 |
|---|
| Year of publishing: | 2003 |
|---|
| Number of pages: | str. 123-127 |
|---|
| Numbering: | Vol. 13 |
|---|
| PID: | 20.500.12556/DKUM-51510  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 1571-0653 |
|---|
| COBISS.SI-ID: | 13825625 |
|---|
| NUK URN: | URN:SI:UM:DK:YKNMVZQ1 |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1260 |
|---|
| Downloads: | 116 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
