Abstract
<p class="p1">Characterizing all graphs having a certain locating-chromatic number is not an easy task. In this paper, we are going to pay attention on finding all unicyclic graphs of order <em>n</em> (⩾ 6) and having locating-chromatic number <em>n</em>-3.</p>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have