Discrete Mathematics & Theoretical Computer Science (Jan 2010)

Covering codes in Sierpinski graphs

Laurent Beaudou,
Sylvain Gravier,
Sandi Klavžar,
Matjaz Kovse,
Michel Mollard

Affiliations

Laurent Beaudou: Laboratoire Bordelais de Recherche en Informatique
Sylvain Gravier: ORCiD; Laboratoire Leibniz
Sandi Klavžar: Faculty of Mathematics and Physics [Ljubljana]
Matjaz Kovse: Institute of Mathematics, Physics and Mechanics [Ljubljana]
Michel Mollard: Institut Fourier

DOI: https://doi.org/10.46298/dmtcs.508
Journal volume & issue: Vol. Vol. 12 no. 3, no. Graph and Algorithms

Abstract

Graphs and Algorithms

Published in Discrete Mathematics & Theoretical Computer Science

ISSN: 1462-7264 (Print); 1365-8050 (Online)
Publisher: Discrete Mathematics & Theoretical Computer Science
Country of publisher: France
LCC subjects: Science: Mathematics
Website: https://dmtcs.episciences.org/

About the journal