A Study on Independence Number in Cluster Hypergraphs

Authors

  • Mary Christal Flower. C Research Scholar, Department of Mathematics, Holy Cross College (Autonomous), Nagercoil, India
  • Befija Minnie. J Assistant Professor, Department of Mathematics, Holy Cross College (Autonomous), Nagercoil, India
  • Jancy Vini. A Assistant Professor, Department of Mathematics, Holy Cross College (Autonomous), Nagercoil, India

Keywords:

cluster hypergraph, independence number, strongly independence number, independent domination number.

Abstract

Letbe a non-empty set and let be a subset ofsuch that and .Let  be a multi set whose elements belong to such that  and for each element , there exists atleast one element  such that .Then  is said to be cluster hypergraph. This article explores the concept of Independence Number and Strongly Independence Number in Cluster Hypergraphs. Also it is demonstrated that ,also some theorems related to the concept Independence Number in Cluster Hypergraphs have been discussed and demonstrated in this article.

Downloads

Published

2024-09-24

How to Cite

Mary Christal Flower. C, Befija Minnie. J, & Jancy Vini. A. (2024). A Study on Independence Number in Cluster Hypergraphs. Journal of Computational Analysis and Applications (JoCAAA), 33(07), 1209–1212. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/1197

Issue

Vol. 33 No. 07 (2024): JOCAAA

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Similar Articles

<< < 8 9 10 11 12 13 

You may also start an advanced similarity search for this article.