Let G = （V（G）, E（G）） be a simple connected graph of order n. For any vertices u, v, w ￠V（G） with uv ∈ E（G） and uw ￠ E（G）, an edge-rotating of G means rotating the edge uv （around u） to the non-edge po...Let G = （V（G）, E（G）） be a simple connected graph of order n. For any vertices u, v, w ￠V（G） with uv ∈ E（G） and uw ￠ E（G）, an edge-rotating of G means rotating the edge uv （around u） to the non-edge position uw. In this work, we consider how the least eigenvalue of a graph perturbs when the graph is performed by rotating an edge from the shorter hanging path to the longer one.展开更多
基金Supported by the National Natural Science Foundation of China(No.11201432,No.11301440)the Natural Science Foundation of Education Ministry of Henan Province(No.15A110003,No.15IRTSTHN006,No.13B110939)
文摘Let G = （V（G）, E（G）） be a simple connected graph of order n. For any vertices u, v, w ￠V（G） with uv ∈ E（G） and uw ￠ E（G）, an edge-rotating of G means rotating the edge uv （around u） to the non-edge position uw. In this work, we consider how the least eigenvalue of a graph perturbs when the graph is performed by rotating an edge from the shorter hanging path to the longer one.
