The number of edges, spectral radius and Hamilton-connectedness of graphs-Reference-Cited by-同舟云学术

The number of edges, spectral radius and Hamilton-connectedness of graphs

Published:2018-02-15 Issue:4 Volume:35 Page:1104-1127
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Chen Ming-Zhu,Zhang Xiao-Dong

Funder

the Joint NSFC-ISF Research Program (jointly funded by the National Natural Science Foundation of China and the Israel Science Foundation

the National Natural Science Foundation of China

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/s10878-018-0260-3/fulltext.html

Reference26 articles.

1. Benediktovich VI (2016) Spectral condition for Hamiltonicity of a graph. Linear Algebra Appl 494:70–79

2. Berge C (1976) Graphs and hypergraphs (Minieka E, trans.) 2nd revised edn, vol 6. Elsevier, Amsterdam

3. Bondy JA, Chvátal V (1976) A method in graph theory. Discrete Math 15(2):111–135

4. Universitext;AE Brouwer,2012

5. Csikvári P (2009) On a conjecture of V. Nikiforov. Discrete Math 309:4522–4526

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An improvement of sufficient condition for k-leaf-connected graphs;Discrete Applied Mathematics;2023-05

2. On the maximal α-spectral radius of graphs with given matching number;Linear and Multilinear Algebra;2022-05-04

3. An improvement of spectral conditions for Hamilton-connected graphs;Linear and Multilinear Algebra;2021-06-30

4. Unified Spectral Hamiltonian Results of Balanced Bipartite Graphs and Complementary Graphs;Graphs and Combinatorics;2020-06-28

5. Spectral results on Hamiltonian problem;Discrete Mathematics;2019-06