%0 Journal Article %T Symmetric regular cacti-properties and enumeration %A S. K Vaidya %A D. D Bantva %J Proyecciones (Antofagasta) %D 2012 %I Universidad Cat¨®lica del Norte %X 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. %K Block %K cactus %K cut vertex %U http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172012000300006