On the Positive and Negative p-Energies of Graphs under Edge Addition
read the original abstract
In this paper, we introduce the concepts of positive and negative $p$-energies of graphs and investigate their behavior under edge addition. Specifically, we generalize the classical notions of positive and negative square energies to the $p$-energy setting, denoted by $\mathcal{E}_p^{+}(G)$ and $\mathcal{E}_p^{-}(G)$, respectively. We establish improved lower bounds for these quantities under edge addition, which sharpen existing results by Abiad et al.\ in the case $p=2$. Furthermore, we address the monotonicity problem for $\mathcal{E}_p^{+}(G)$ under edge addition, and construct a family of counterexamples showing that monotonicity fails for $1 \leq p < 3$. Finally, we conclude with several open problems for further investigation.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Positive and negative 3-energies of graphs
Proves E^+_3(G) >= (sqrt(5)/2)n for connected n-vertex graphs except K1, K2, P3, and proves E^-_p(G) >= E^-_p(K_n) for all p >= 3.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.