کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8901190 1631731 2018 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Some sufficient conditions on k-connected graphs
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
Some sufficient conditions on k-connected graphs
چکیده انگلیسی
A connected graph G is said to be k-connected if it has more than k vertices and remains connected whenever fewer than k vertices are removed. Feng et al. (2017) presented sufficient conditions based on spectral radius for a graph to be k-connected, k-edge-connected, k-Hamiltonian, k-edge-Hamiltonian, β-deficient and k-path-coverable. In this paper, we present some further sufficient conditions for a graph to be k-connected in terms of signless Laplacian spectral radius, distance spectral radius, distance signless Laplacian spectral radius of G and Wiener index, Harary index of its complement.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 325, 15 May 2018, Pages 332-339
نویسندگان
, , ,