Convex Accessibility Number of the Complements and Some Binary Operations of Graphs

Authors

  • Harold Samson Mindanao State University Iligan Institute of Technology
  • Imelda S. Aniversario
  • Mary Joy F. Luga

DOI:

https://doi.org/10.29020/nybg.ejpam.v17i4.5332

Keywords:

$H$-Convex accessibility number, convex subgraph, strong product, cartesian product, complement of a graph, accessibility number

Abstract

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

2024-10-31

Issue

Section

Nonlinear Analysis

How to Cite

Convex Accessibility Number of the Complements and Some Binary Operations of Graphs. (2024). European Journal of Pure and Applied Mathematics, 17(4), 2930-2938. https://doi.org/10.29020/nybg.ejpam.v17i4.5332