TY - JOUR
TI - J-Open Independent Sets in Graphs
PY - 2024/04/30
Y2 - 2024/08/05
JF - European Journal of Pure and Applied Mathematics
JA - Eur. J. Pure Appl. Math.
VL - 17
IS - 2
DO - 10.29020/nybg.ejpam.v17i2.5084
UR - https://doi.org/10.29020/nybg.ejpam.v17i2.5084
SP - 922-930
AB - Let $G
eq \overline{K}_n$ be a graph with vertex and edge-sets $V(G)$ and $E(G)$, respectively. Then\linebreak $O$ $\subseteq$ $V(G)$ is called a J-open independent set of $G$ if for every $a,b \in V(G)$ where $a
eq b$, $d_G(a,b)$ $
eq 1$, and $N_G(a) \backslash N_G(b)
eq \varnothing$ and $N_G(b)\backslash N_G(a)
eq \varnothing$. The maximum cardinality of a J-open independent set of G, denoted by $\alpha_J(G)$, is called the J-open independence number of $G$. In this paper, we introduce new independence parameter called J-open independence. We show that this parameter is always less than or equal to the standard independence (resp. J-total domination) parameter of a graph. In fact, their differences can be made arbitrarily large. In addition, we show that J-open independence parameter is incomparable with hop independence parameter. Moreover, we derive some formulas and bounds of the parameter for some classes of graphs and the join of two graphs.
ER -