A note on a walk-based inequality for the index of a signed graph

Abstract

We 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.

Keywords

• signed graph
• walk
• adjacency matrix
• index
• upper bound
• 05c22
• 05c50