کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8897748 1631041 2018 23 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Minimum rank and path cover number for generalized and double generalized cycle star graphs
ترجمه فارسی عنوان
حداقل تعداد رتبه و مسیر پوشش برای نمودار ستاره چرخه ی عمومی و دوگانه
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
چکیده انگلیسی
For a given connected (undirected) graph G=(V,E), with V={1,…,n}, the minimum rank of G is defined to be the smallest possible rank over all symmetric matrices A=[aij] such that for i≠j, aij=0 if, and only if, {i,j}∉E. The path cover number of G is the minimum number of vertex-disjoint paths occurring as induced subgraphs of G that cover all the vertices of G. When G is a tree, the values of the minimum rank and of the path cover number are known as well the relationship between them. We study these values and their relationship for all graphs that have at most two vertices of degree greater than two: generalized cycle stars and double generalized cycle stars.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 554, 1 October 2018, Pages 146-169
نویسندگان
, ,