Search

Nanomaterials (NMs) have piqued the attention of scientists and researchers across many biomedical sciences due to their superior physical, chemical, and magnetic properties. The efficacy and efficiency of NMs depend on adapting to specific site conditions and soil composition. NMs have lately received much attention in the context of polycyclic aromatic hydrocarbons (PAHs) polluted soil remediation and water mitigation because of their unique properties resulting from their nanoscale sizes. The remediation of hazardous PAHs in water and soil is a hot research subject. Because the exposure of PAHs in water and soil results in pollution, which raises major human health concerns. The current review reports novel advancements in NMs that subsidize enhancement for degradation of PAHs. Challenges to the fabrication of high activity-based photocatalytic materials are also discussed. Furthermore, this review delivers exclusive and wide-ranging perspectives on the fabrication of nanomaterial-based photocatalytic systems. The knowledge of both soil remediation and water mitigation is also updated.

This article has been retracted. A retraction notice can be found at https://doi.org/10.3233/JIFS-219433. [ABSTRACT FROM AUTHOR]

A pseudo coloring of the vertices of a graph G, is a coloring assigned to the vertices of G such that adjacent vertices can receive the same colors. A pseudo complete coloring of a graph G is a pseudo coloring of the vertices of G, such that for any pair of distinct colors, there is at least one edge whose end vertices are colored with this pair of colors. The maximum number of colors used in a pseudo complete coloring of G is called the pseudo achromatic number, denoted by ψs(G). A neighborhood pseudo chromatic number of a graph G, denoted by ψnhd(G), is the maximum number of colors used in a pseudo coloring of G, such that every vertex has at least two vertices in its closed neighborhood receiving the same color. Here, we defined a new coloring parameter called neighborhood pseudo achromatic number of a graph G and obtained neighborhood pseudo achromatic number of a complete p-partite graph by analysing various possibilitie [ABSTRACT FROM AUTHOR]