Let Γ = (V,E) be a simple and undirected graph. General power graph of Γ, shown by Pg(Γ), is a graph with the vertex set P(V (Γ))\ϕ. Also two distinct vertices of B and C are adjacent if and only if every b ∈ B is adjacent to every c ∈ C \{b} in Γ. In this paper, we consider general power graph related to graph Γ. Also we show that zero forcing number is equal to maximum nullity, for general power graph of some graphs.
Vatandoost, E., & Kheiridosst, F. (2024). Zero Forcing Number and Maximum Nullity of General Power Graphs. Journal of Algebraic Systems, (), -. doi: 10.22044/jas.2023.13260.1737
MLA
Ebrahim Vatandoost; Fateme Kheiridosst. "Zero Forcing Number and Maximum Nullity of General Power Graphs", Journal of Algebraic Systems, , , 2024, -. doi: 10.22044/jas.2023.13260.1737
HARVARD
Vatandoost, E., Kheiridosst, F. (2024). 'Zero Forcing Number and Maximum Nullity of General Power Graphs', Journal of Algebraic Systems, (), pp. -. doi: 10.22044/jas.2023.13260.1737
VANCOUVER
Vatandoost, E., Kheiridosst, F. Zero Forcing Number and Maximum Nullity of General Power Graphs. Journal of Algebraic Systems, 2024; (): -. doi: 10.22044/jas.2023.13260.1737
)