A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
A note on a walk-based inequality for the index of a signed graph
2021
Special Matrices
Preserved Fulltext
AbstractWe derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.
doi:10.1515/spma-2020-0120
fatcat:nd7usezxdjeyhas6x6tdjhnlsi