Zobrazeno 1 - 2
of 2
pro vyhledávání: '"kode v grafih"'
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (3), pp.63-74
Scopus-Elsevier
Discrete Mathematics and Theoretical Computer Science, vol. 12, no. 3, pp. 63-74, 2010.
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (3), pp.63-74
Scopus-Elsevier
Discrete Mathematics and Theoretical Computer Science, vol. 12, no. 3, pp. 63-74, 2010.
Graphs and Algorithms
For a graph G and integers a and b, an (a, b)-code of G is a set C of vertices such that any vertex from C has exactly a neighbors in C and any vertex not in C has exactly b neighbors in C. In this paper we classify integer
For a graph G and integers a and b, an (a, b)-code of G is a set C of vertices such that any vertex from C has exactly a neighbors in C and any vertex not in C has exactly b neighbors in C. In this paper we classify integer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7624564b138e9f5c63b2fa966880a84c
https://doi.org/10.46298/dmtcs.508
https://doi.org/10.46298/dmtcs.508
