Photo by lukechesser from unsplash
Abstract Signed graphs are graphs whose edges get signs ±1 and, as for unsigned graphs, they can be studied by means of graph matrices. Here we focus our attention to… Click to show full abstract
Abstract Signed graphs are graphs whose edges get signs ±1 and, as for unsigned graphs, they can be studied by means of graph matrices. Here we focus our attention to the largest eigenvalue, also known as the index of the adjacency matrix of signed graphs. Firstly we give some general results on the index variation when the corresponding signed graph is perturbed. Also, we determine signed graphs achieving the minimal or the maximal index in the class of unbalanced unicyclic graphs of order n ≥ 3 .
Keywords:
signed graphs;
unicyclic graphs;
eigenvalue signed;
largest eigenvalue
Journal Title: Linear Algebra and its Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Linear Algebra and its Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!