Symmetric regular cacti-properties and enumeration

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.