Symmetric regular cacti-properties and enumeration

• Vaidya, S. K. ^[1] ; Bantva, D.D. ^[2]
  1. [1] Saurashtra University

     Saurashtra University

     India

     
  2. [2] L.E. College, Morvi.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 31, Nº. 3, 2012, págs. 261-275
• Idioma: inglés
• DOI: 10.4067/S0716-09172012000300006
• Enlaces
  • Texto completo
• Resumen

  • 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.

• Referencias bibliográficas
  • Citas [1] J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, DS6, 18 : 12 and 49, (2011).
  • [2] S. K. Vaidya, D. D. Bantva, Labeling cacti with a condition at distance two, Le Mathematiche, 66 : pp. 29-36, (2011).
  • [3] D. B. West, Introduction to Graph Theory, Prentice-Hall of India, (2001).