Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
Cart
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Home
Journals
Journal of Artificial Intelligence and Soft Computing Research
Volume 8 (2018): Issue 4 (October 2018)
Open Access
The Least Eigenvalue of the Graphs Whose Complements Are Connected and Have Pendent Paths
Chen Wang
Chen Wang
,
Guidong Yu
Guidong Yu
,
Wei Sun
Wei Sun
and
Jinde Cao
Jinde Cao
| May 17, 2018
Journal of Artificial Intelligence and Soft Computing Research
Volume 8 (2018): Issue 4 (October 2018)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
May 17, 2018
Page range:
303 - 308
Received:
Jan 27, 2018
Accepted:
Mar 16, 2018
DOI:
https://doi.org/10.1515/jaiscr-2018-0020
Keywords
graph
,
complement
,
pendent path
,
adjacency matrix
,
the least eigenvalue
© 2018
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
Chen Wang
School of Mathematics and Statistics, Guizhou University,
Guiyang, China
Guidong Yu
School of Mathematics and Computation Sciences, Anqing Normal University,
Anqing, China
Wei Sun
School of Mathematics and Computation Sciences, Anqing Normal University,
Anqing, China
Jinde Cao
School of Mathematics, Southeast University, Nanjing,
Jiangsu, China