کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4650372 1342485 2008 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Hamiltonian problem on claw-free and almost distance-hereditary graphs
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Hamiltonian problem on claw-free and almost distance-hereditary graphs
چکیده انگلیسی

Let G=(V,E)G=(V,E) be a connected graph. The distance between two vertices xx and yy in GG, denoted by dG(x,y)dG(x,y), is the length of a shortest path between xx and yy. A graph GG is called almost distance-hereditary, if each connected induced subgraph HH of GG has the property that dH(u,v)≤dG(u,v)+1dH(u,v)≤dG(u,v)+1 for every pair of vertices uu and vv in HH. We will confirm that every 2-connected, claw-free and almost distance-hereditary graph has a Hamiltonian cycle.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 308, Issue 24, 28 December 2008, Pages 6558–6563
نویسندگان
, ,