Abstract
Let 〖SH(M〗_di) be the matrix of Skew-Hermitian adjacency and let M_dibe an asymmetrical middle graph. A latterly weighed Skew-Hermitian connection matric can be obtained as we proceed assign a Randic the amount as to each curve and boundary in 〖SH(M〗_di). In light of here, we as a species describe the Randic Skew-Hermitian matrix using these Skew-Hermitian adjacency matrix features. 〖R^*〗_SH (M_di )=(〖r^*〗_SH )_xy within a asymmetrical graph M_di Whereas (〖r^*〗_SH )_xy=((-i)/√(d_x d_y )) (i=√(-1) if (v_x,v_y )) is an arc of M_di, (〖r^*〗_SH )_xy=(i/√(d_x d_y ))(i=√(-1) if (v_x,v_y )) is an arc of M_di, (〖r^*〗_SH )_xy=((-1)/√(d_x d_y )) if (v_x,v_y ) is an undirected edge of M_di, and (〖r^*〗_SH )_xy=0 if of M_di. The main purpose of this study is to calculate the Randic Skew-Hermitian matrix of a asymmetrical middle graph's characteristic polynomial. Moreover, we provide boundaries on the applicable asymmetrical middle graph's Randic Skew-Hermitian energy. Finally, we provide some findings regarding the asymmetrical middle graphs' Randic energy with skew-Hermitian .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.