Examines the relationship between zero forcing number and maximum nullity in power graphs, suggesting an equivalence for certain graphs.
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.
No takes yet. Share an insight, caveat, or question.
Kheiridosst et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: