Pokrivne kode v grafih Sierpińskega
| Autor: | Michel Mollard, Sylvain Gravier, Matjaz Kovse, Sandi Klavžar, Laurent Beaudou |
|---|---|
| Přispěvatelé: | Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Institut Fourier (IF ), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Laboratoire Leibniz (Leibniz - IMAG), Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Grenoble (INPG)-Université Joseph Fourier - Grenoble 1 (UJF), Faculty of Mathematics and Physics [Ljubljana] (FMF), University of Ljubljana, Faculty of Natural Sciences and Mathematics [Maribor], University of Maribor, Institute of Mathematics, Physics and Mechanics [Ljubljana], Institute of Mathematics, Physics and Mechanics, Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Sciences et Technologies - Bordeaux 1-Université Bordeaux Segalen - Bordeaux 2, Institut Fourier (IF), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Université Joseph Fourier - Grenoble 1 (UJF)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS) |
| Rok vydání: | 2010 |
| Předmět: |
perfect codes
General Computer Science Hamming bound graph theory [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] 010402 general chemistry 01 natural sciences Theoretical Computer Science Combinatorics Indifference graph Discrete Mathematics and Combinatorics Mathematics grafi Sierpińskega Discrete mathematics kode v grafih 010405 organic chemistry Neighbourhood (graph theory) codes in graphs Interval graph Graph theory Sierpiński graphs Sierpinski graphs udc:519.17 0104 chemical sciences Sierpinski triangle Vertex (geometry) [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM] teorija grafov popolne kode Bound graph MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | 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. |
| ISSN: | 1365-8050 1462-7264 |
| DOI: | 10.46298/dmtcs.508 |
| Popis: | 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 integers a and b for which there exist (a, b)-codes in Sierpinski graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|