Symmetric regular cacti-properties and enumeration
DOI:
https://doi.org/10.4067/S0716-09172012000300006Keywords:
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.Downloads
Download data is not yet available.
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).
[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).
Downloads
Published
2012-10-29
Issue
Section
Artículos
License
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
How to Cite
[1]
“Symmetric regular cacti-properties and enumeration”, Proyecciones (Antofagasta, On line), vol. 31, no. 3, pp. 261–275, Oct. 2012, doi: 10.4067/S0716-09172012000300006.
