An upper bound on the distinguishing index of graphs with minimum degree at least two
عنوان مقاله: An upper bound on the distinguishing index of graphs with minimum degree at least two
شناسه ملی مقاله: JR_ASYAZDT-7-2_004
منتشر شده در در سال 1399
شناسه ملی مقاله: JR_ASYAZDT-7-2_004
منتشر شده در در سال 1399
مشخصات نویسندگان مقاله:
Saeid Alikhani - Department of Mathematics, Yazd University, ۸۹۱۹۵-۷۴۱, Yazd, Iran
Samaneh Soltani - Department of Mathematics, Yazd University, ۸۹۱۹۵-۷۴۱, Yazd, Iran
خلاصه مقاله:
Saeid Alikhani - Department of Mathematics, Yazd University, ۸۹۱۹۵-۷۴۱, Yazd, Iran
Samaneh Soltani - Department of Mathematics, Yazd University, ۸۹۱۹۵-۷۴۱, Yazd, Iran
The distinguishing index of a simple graph G, denoted by D'(G), is the least number of labels in an edge labeling of G not preserved by any non-trivial automorphism. We prove that for a connected graph G with maximum degree \Delta, if the minimum degree is at least two, then D'(G)\leq \lceil \sqrt{\Delta }\rceil +۱. We also present graphs G for which D'(G)\leq \lceil \sqrt{\Delta (G)}\rceil.
کلمات کلیدی: distinguishing index, edge-colourings, upper bound
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1579993/