Have a personal or library account? Click to login
The Least Eigenvalue of the Graphs Whose Complements Are Connected and Have Pendent Paths Cover

The Least Eigenvalue of the Graphs Whose Complements Are Connected and Have Pendent Paths

Journal of Artificial Intelligence and Soft Computing Research
Volume 8 (2018): Issue 4 (October 2018)
By: Chen Wang,  Guidong Yu,  Wei Sun and  Jinde Cao  
Open Access
|May 2018

Authors

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
DOI: https://doi.org/10.1515/jaiscr-2018-0020
Journal RSS Feed
Language: English
Page range: 303 - 308
Submitted on: Jan 27, 2018
Accepted on: Mar 16, 2018
Published on: May 17, 2018
Published by: SAN University
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
graph,
complement,
pendent path,
adjacency matrix,
the least eigenvalue
Related subjects:
Computer sciences,
Databases and data mining,
Artificial intelligence

© 2018 Chen Wang, Guidong Yu, Wei Sun, Jinde Cao, published by SAN University
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous articleVolume 8 (2018): Issue 4 (October 2018)