Symmetric regular cacti-properties and enumeration

dc.creator	Vaidya, S. K.	es
dc.creator	Bantva, D.D.	es
dc.date	2012-10-29
dc.date.accessioned	2025-03-31T13:12:20Z
dc.date.available	2025-03-31T13:12:20Z
dc.identifier	https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1144
dc.identifier	10.4067/S0716-09172012000300006
dc.identifier.uri	https://revistaschilenas.uchile.cl/handle/2250/250928
dc.description	A cactus is a connected graph whose all the blocks are isomorphic to cycle or complete graph on n vertices. We introduce symmetric regular cacti and a procedure for their construction. We discuss some characteristics of symmetric regular cacti. The number of symmetric regular cacti on given number of vertices are also enumerated. A possible application of present work to a real world problem for the committee formation is also suggested.	es
dc.format	application/pdf
dc.language	spa
dc.publisher	Universidad Católica del Norte.	en
dc.relation	https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1144/1142
dc.rights	Copyright (c) 2012 Proyecciones. Journal of Mathematics	en
dc.source	Proyecciones (Antofagasta, On line); Vol. 31 No. 3 (2012); 261-275	en
dc.source	Proyecciones. Revista de Matemática; Vol. 31 Núm. 3 (2012); 261-275	es
dc.source	0717-6279
dc.title	Symmetric regular cacti-properties and enumeration	es
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion