Convex Accessibility Number of the Complements and Some Binary Operations of Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v17i4.5332Keywords:
$H$-Convex accessibility number, convex subgraph, strong product, cartesian product, complement of a graph, accessibility numberAbstract
This study explores various aspects of the Convex accessibility number in graph theory, focusing on some binary operations namely cartesian product and strong product and complements of graphs. The computation of the Convex accessibility number of Cartesian product and Strong product of graphs is examined. Also, the Convex accessibility number of the complement of some known graphs is explored. Through these investigations, this study contributes to a deeper understanding of the Convex accessibility number in graph theory, offering insights into its behavior under different graph operations and complementation scenarios.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Harold Samson, Imelda S. Aniversario, Mary Joy F. Luga
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.