Covering codes in Sierpiński graphs

Beaudou, Laurent; Gravier, Sylvain; Klavžar, Sandi; Kovše, Matjaž; Mollard, Michel

| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

First page > Show document

Show document

Title:	Covering codes in Sierpiński graphs
Authors:	ID Beaudou, Laurent (Author) ID Gravier, Sylvain (Author) ID Klavžar, Sandi (Author) ID Kovše, Matjaž (Author) ID Mollard, Michel (Author)
Files:	Discrete_Mathematics_&_Theoretical_Computer_Science_2014_Beaudou_et_al._Covering_codes_in_Sierpinski_graphs.pdf (786,68 KB) MD5: 1266964E10E6571C792B1AD4E0AF36D6 http://dmtcs.episciences.org/508
Language:	English
Work type:	Scientific work
Typology:	1.01 - Original Scientific Article
Organization:	FNM - Faculty of Natural Sciences and Mathematics
Abstract:	Za dani graf $G$ in celi števili $a$ in $b$ je $(a,b)$ -koda grafa $G$ množica vozlišč $C$ , tako da ima vsako vozlišče iz $C$ natanko $a$ sosedov v $C$ , vsako drugo vozlišče pa natanko $b$ sosedov v $C$ . V tem prispevku klasificiramo števila $a$ in $b$ , za katera obstajajo $(a,b)$ -kode v grafih Sierpińskega.
Keywords:	graph theory, codes in graphs, perfect codes, Sierpiński graphs
Publication status:	Published
Publication version:	Version of Record
Year of publishing:	2010
Number of pages:	str. 63-74
Numbering:	Letn. 12, št. 3
PID:	20.500.12556/DKUM-58152
ISSN:	1365-8050
UDC:	519.17
ISSN on article:	1365-8050
COBISS.SI-ID:	15649881
NUK URN:	URN:SI:UM:DK:SCFSE74F
Publication date in DKUM:	10.07.2017
Views:	1166
Downloads:	183
Metadata:
Categories:	Misc.
:	BEAUDOU, Laurent, GRAVIER, Sylvain, KLAVŽAR, Sandi, KOVŠE, Matjaž and MOLLARD, Michel, 2010, Covering codes in Sierpiński graphs. Discrete mathematics & theoretical computer science [online]. 2010. Vol. 12, no. 3, p. 63–74. [Accessed 23 April 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=58152 Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Searching for similar works... Please wait....

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:	Discrete mathematics & theoretical computer science
Shortened title:	Discret. math. theor. comput. sci.
Publisher:	DMTCS
ISSN:	1365-8050
COBISS.SI-ID:	8089433

Document is financed by a project

Funder:	ARRS - Slovenian Research Agency
Project number:	17934PB

Licences

License:	CC BY 4.0, Creative Commons Attribution 4.0 International

Link:	http://creativecommons.org/licenses/by/4.0/
Description:	This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:	08.04.2016

Secondary language

Language:	Slovenian
Title:	Pokrivne kode v grafih Sierpińskega
Abstract:	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 exists $(a,b)$ -codes in Sierpiński graphs.
Keywords:	teorija grafov, kode v grafih, popolne kode, grafi Sierpińskega

Comments

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back