SciELO - Scientific Electronic Library Online

 
vol.31 issue3On the spectral radius of weighted digraphsNew numerical radius inequalities for certain operator matrices author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Proyecciones (Antofagasta)

Print version ISSN 0716-0917

Proyecciones (Antofagasta) vol.31 no.3 Antofagasta Sept. 2012

http://dx.doi.org/10.4067/S0716-09172012000300006 

Proyecciones Journal of Mathematics Vol. 31, No 3, pp. 261-275, September 2012. Universidad Católica del Norte Antofagasta - Chile

Symmetric regular cacti-properties and enumeration

 

S. K. Vaidya

Saurashtra University, India

D. D. Bantva

L. E. College, India


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.

Keywords : Block, cactus, cut vertex.


REFERENCES

[1] J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, j|DS6, 18 : 12 and 49, (2011).         [ Links ]

[2] S. K. Vaidya, D. D. Bantva, Labeling cacti with a condition at distance two, Le Mathematiche, 66 : pp. 29-36, (2011).         [ Links ]

[3] D. B. West, Introduction to Graph Theory, Prentice -Hall of India, (2001).         [ Links ]

S. K. Vaidya

Department of Mathematics Saurashtra University, Rajkot - 360005 Gujarat

INDIA

e-mail : samirkvaidya@yahoo.co.in

D. D. Bantva

Department of Mathematics

L. E. College, Morvi - 363642

Gujarat

INDIA

e-mail : devsi.bantva@gmail.com

Received : March 2012. Accepted : June 2012

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License