Conversion of Unweighted Graphs to Weighted Graphs Satisfying Properties <mml:semantics>R</mml:semantics> and <mml:semantics>-SR</mml:semantics>

Spectral graph theory is like a special tool for understanding graphs. It helps us find patterns and connections in complex networks, using the magic of eigenvalues. Let G be the graph and A(G) be its adjacency matrix, then G is singular if the determinant of the adjacency matrix A(G) is 0, otherwise it is nonsingular. Within the realm of nonsingular graphs, there is the concept of property R, where each eigenvalue's reciprocal is also an eigenvalue of G. By introducing multiplicity constraints on both eigenvalues and their reciprocals, it becomes property SR. Similarly, the world of nonsingular graphs reveals property -R, where the negative reciprocal of each eigenvalue also finds a place within the spectrum of G. Moreover, when the multiplicity of each eigenvalue and its negative reciprocal is equal, this results in a graph with a property of -SR. Some classes of unweighted nonbipartite graphs are already constructed in the literature with the help of the complete graph K-n and a copy of the path graph P(4 )satisfying property R but not SR. This article takes this a step further. The main aim is to construct several weighted classes of graphs which satisfy property R but not SR. For this purpose, the weight functions are determined that enable these nonbipartite graph classes to satisfy the -SR and R properties, even if the unweighted graph does not satisfy these properties. Some examples are presented to support the investigated results. These examples explain how certain weight functions make these special types of graphs meet the properties R or -SR, even when the original graphs without weights do not meet these properties.