Zobrazeno 1 - 7
of 7
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
Autor:
Wagner, Stephan1 swagner@sun.ac.za, Wang, Hua2 hwang@georgiasouthern.edu
Publikováno v:
Graphs & Combinatorics. Nov2014, Vol. 30 Issue 6, p1593-1605. 13p.
Autor:
Sugiyama, Takeshi1 sugiyama@gssm.otsuka.tsukuba.ac.jp
Publikováno v:
Advances & Applications in Discrete Mathematics. Jan2013, Vol. 11 Issue 1, p67-77. 11p.
Autor:
Backelin, Jörgen1 joeb@math.su.se, Linusson, Svante2 linusson@math.kth.se
Publikováno v:
Annals of Combinatorics. 2006, Vol. 10 Issue 1, p1-18. 18p. 3 Diagrams, 1 Chart.
Autor:
Zhongyuan Che
Publikováno v:
Czechoslovak Mathematical Journal; Mar2007, Vol. 57 Issue 1, p377-386, 10p