Search Results

You are looking at 1 - 1 of 1 items for

  • Author: Guidong Yu x
Clear All Modify Search
Open access

Chen Wang, Guidong Yu, Wei Sun and Jinde Cao

Abstract

The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices of the graph. Its minimum eigenvalue is defined as the least eigenvalue of the graph. Let Gn be the set of the graphs of order n, whose complements are connected and have pendent paths. This paper investigates the least eigenvalue of the graphs and characterizes the unique graph which has the minimum least eigenvalue in Gn.