Zobrazeno 1 - 2
of 2
pro vyhledávání: '"05C60, 05C05"'
The edge-reconstruction number ern$(G)$ of a graph $G$ is equal to the minimum number of edge-deleted subgraphs $G-e$ of $G$ which are sufficient to determine $G$ up to isomorphsim. Building upon the work of Molina and using results from computer sea
Externí odkaz:
http://arxiv.org/abs/1312.1234
Publikováno v:
Scopus-Elsevier
The edge-reconstruction number ern$(G)$ of a graph $G$ is equal to the minimum number of edge-deleted subgraphs $G-e$ of $G$ which are sufficient to determine $G$ up to isomorphsim. Building upon the work of Molina and using results from computer sea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0177ef4edf2531465022806dfe10b295
https://www.um.edu.mt/library/oar/handle/123456789/111599
https://www.um.edu.mt/library/oar/handle/123456789/111599