ǂA ǂ2-parametric generalization of Sierpiński gasket graphs

Abstract

Graphs ▫$S[n,k]$▫ are introduced as the graphs obtained from the Sierpiński graphs ▫$S(n,k)$▫ by contracting edges that lie in no triangle. The family ▫$S[n,k]$▫ is a previously studied class of Sierpiñski gasket graphs ▫$S_n$▫. Several properties of graphs ▫$S[n,k]$▫ are studied in particular, hamiltonicity and chromatic number.

Keywords

teorija grafov;kromatično število;Sierpińskijev graf;graph theory;chromatic number;Sierpiński graphs;Sierpiński gasket graphs;hamiltonicity;

Data

Language:	English
Year of publishing:	2009
Typology:	0 - Not set
Organization:	UM FNM - Faculty of Natural Sciences and Mathematics
UDC:	519.174
COBISS:	15085145
ISSN:	1318-4865
Views:	744
Downloads:	38
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	Unknown
Secondary keywords:	teorija grafov;kromatično število;Sierpińskijev graf;
URN:	URN:SI:UM:
Type (COBISS):	Not categorized
Pages:	str. 1-10
Volume:	ǂVol. ǂ47
Issue:	ǂšt. ǂ1082
Chronology:	2009
ID:	1474173