Symmetric regular cacti-properties and enumeration

Authors

  • S. K. Vaidya Saurashtra University.
  • D.D. Bantva L.E. College, Morvi.

DOI:

https://doi.org/10.4067/S0716-09172012000300006

Keywords:

Block, cactus, cut vertex, vértice de corte.

Abstract

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.

Author Biographies

S. K. Vaidya, Saurashtra University.

Department of Mathematics.

D.D. Bantva, L.E. College, Morvi.

Department of Mathematics.

References

[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).

Published

2012-10-29

How to Cite

[1]
S. K. Vaidya and D. Bantva, “Symmetric regular cacti-properties and enumeration”, Proyecciones (Antofagasta, On line), vol. 31, no. 3, pp. 261-275, Oct. 2012.

Issue

Section

Artículos