[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.14317/jami.2016.221

SUFFICIENT CONDITIONS FOR SOME HAMILTONIAN PROPERTIES AND K-CONNECTIVITY OF GRAPHS

LI, RAO (Department of Mathematical Sciences, University of South Carolina Aiken)

Publication Information

Journal of applied mathematics & informatics / v.34, no.3_4, 2016 , pp. 221-225 More about this Journal

Abstract

For a connected graph G = (V, E), its inverse degree is defined as $\sum_{{\upsilon}{\in}{V}}^{}\frac{1}{d(\upsilon)}$ . Using an upper bound for the inverse degree of a graph obtained by Cioabă in [4], we in this note present sufficient conditions for some Hamiltonian properties and k-connectivity of a graph.

Keywords

Hamiltonian property; k-connected graph;

Citations & Related Records

Reference

1	C. Berge, Graphs and Hypergraphs, American Elsevier Publishing Company, 1976.
2	F. Boesch, The strongest monotone degree condition for n-connectedness of a graph, J. Combin. Theory Ser. B 16 (1974), 162-165. DOI
3	J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York, 1976.
4	S. Cioabă, Sums of powers of the degrees of a graph, Discrete Math. 306 (2006), 1959-1964. DOI