Construction of Dominating Sets of Certain Graphs

<table>(a) The path <svg height="15.4" id="M56" style="vertical-align:-3.3907pt" version="1.1" viewbox="0 0 17.5375 15.4" width="17.5375" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,15.187)"><path d="M495 86q-46 -47 -87 -72.5t-63 -25.5q-43 0 -16 107l49 210q7 34 8 50.5t-3 21t-13 4.5q-35 0 -109.5 -72.5t-115.5 -140.5q-21 -75 -38 -159q-50 -10 -76 -21l-6 8l84 340q8 35 -4 35q-17 0 -67 -46l-15 26q44 44 85.5 70.5t64.5 26.5q35 0 10 -103l-24 -98h2
q42 56 97 103.5t96 71.5q46 26 74 26q9 0 16 -2.5t14 -11.5t9.5 -24.5t-1 -44t-13.5 -68.5q-30 -117 -47 -200q-4 -19 -3.5 -25t6.5 -6q21 0 70 48z" id="x1D45B"></path></g>
</svg>; (b) graph <svg height="11.75" id="M57" style="vertical-align:-0.23206pt" version="1.1" viewbox="0 0 12.4375 11.75" width="12.4375" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.4)"><path d="M713 296l-5 -25q-47 -7 -59 -20t-23 -72l-15 -79q-9 -48 -3 -74q-15 -3 -55 -13t-63 -15t-59.5 -10t-70.5 -5q-149 0 -243 80t-94 220q0 169 127.5 276.5t336.5 107.5q91 0 206 -36l-10 -165l-29 -1q1 85 -47.5 126t-146.5 41q-153 0 -243.5 -97t-90.5 -242
q0 -122 68.5 -198.5t188.5 -76.5q121 0 139 75l20 86q13 58 -1.5 70.5t-99.5 20.5l5 26h267z" id="x1D43A"></path></g>
</svg> contains a simple path of length <svg height="12.4375" id="M58" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 8.6750002 12.4375" width="8.6750002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.162)"><path d="M480 416q0 -21 -18 -41q-9 -11 -17 -7q-20 9 -42 9q-62 0 -140 -78q23 -69 88 -192q17 -31 27 -42t20 -11q16 0 62 46l17 -20q-64 -92 -119 -92q-35 0 -70 66q-41 73 -84 187q-36 -30 -62 -61q-27 -115 -35 -172q-41 -8 -78 -20l-6 6l140 612q7 28 0.5 34t-37.5 7l-34 1
l5 26q38 4 74 13.5t57 17t25 7.5q12 0 4 -32l-104 -443h2q35 38 97 93q39 35 65.5 56t62 41.5t58.5 20.5q19 0 30.5 -10t11.5 -22z" id="x1D458"></path></g>
</svg>.</table>

Journal of Discrete Mathematics

Construction of Dominating Sets of Certain Graphs

Figure 1