Let G be a graph of order n, A(G) its adjacency matrix and D(G) the diagonal degrees G. In 2017, for every α in [0, 1], Nikiforov defined Aα(G) = αD(G) + (1 − α)A(G). this paper, we investigate Aα-spectrum graphs obtained from duplicate corona operations. As an application our results, provide conditions construction some pairs non isomorphic Aα-cospectral graphs.

The vertex distance complement (VDC) matrix \(\textit{C}\), of a connected graph \(G\) with set consisting \(n\) vertices, is real symmetric \([c_{ij}]\) that takes the value \(n - d_{ij}\) where \(d_{ij}\) between vertices \(v_i\) and \(v_j\) for \(i \neq j\) 0 otherwise. spectrum subdivision join, \(G_1 \dot{\bigvee} G_2\) edge join \underline{\bigvee} regular graphs \(G_1\) \(G_2\) in terms ...

doctors and clients sometimes experience interactive clashes during hospital meetings in south-western nigerian hospitals because of their divergent culture-constrained orientation to politeness cues. the goal of this paper is to unpack the discursive elements that characterize interactive confluence and divergence in selected consultative encounters in the hospitals. the findings indicate that...