Communication in Combinatorics and Optimization، جلد ۱۰، شماره ۴، صفحات ۷۱۷-۷۲۸

عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله

عنوان انگلیسی On the strength and independence number of powers of paths and cycles
چکیده انگلیسی مقاله A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $left{1,2, ldots, n right}$ to the vertices of $G$. The strength $mathrm{str}left(Gright) $ of $G$ is defined by $mathrm{str}left( Gright) =min left{ mathrm{str}_{f}left( Gright)leftvert ftext{ is a numbering of }Gright. right}$, where $mathrm{str}_{f}left( Gright) =max left{ fleft( uright)+fleft( vright) leftvert uvin Eleft( Gright) right. right} $.
Using the concept of independence number of a graph, we determine formulas for the strength of powers of paths and cycles. To achieve the latter result, we establish a sharp upper bound for the strength of a graph in terms of its order and independence number and a formula for the independence number of powers of cycles.
کلیدواژه‌های انگلیسی مقاله strength,independence number,$k$th power of a graph,graph labeling,combinatorial optimization

نویسندگان مقاله Rikio Ichishima |
Department of Sport and Physical Education, Faculty of Physical Education, Kokushikan University, 7-3-1 Nagayama, Tama-shi, Tokyo 206-8515, Japan

Francisco Antonio Muntaner-Batle |
Graph Theory and Applications Research Group, School of Electrical Engineering and Computer Science, Faculty of Engineering and Built Environment, The University of Newcastle, NSW 2308, Australia

Yukio Takahashi |
Department of Science and Engineering, Faculty of Electronics and Informatics, Kokushikan University, 4-28-1 Setagaya, Setagaya-ku, Tokyo 154-8515, Japan


نشانی اینترنتی https://comb-opt.azaruniv.ac.ir/article_14720_9c26bd36c60a54859c209dab3a0cd6ee.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات