Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 161 tok/s
Gemini 2.5 Pro 40 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 117 tok/s Pro
Kimi K2 149 tok/s Pro
GPT OSS 120B 440 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Optimal bounds on codes for location in circulant graphs (1802.01325v1)

Published 5 Feb 2018 in cs.DM and math.CO

Abstract: Identifying and locating-dominating codes have been studied widely in circulant graphs of type $C_n(1,2,3,\dots, r)$ over the recent years. In 2013, Ghebleh and Niepel studied locating-dominating and identifying codes in the circulant graphs $C_n(1,d)$ for $d=3$ and proposed as an open question the case of $d > 3$. In this paper we study identifying, locating-dominating and self-identifying codes in the graphs $C_n(1,d)$, $C_n(1,d-1,d)$ and $C_n(1,d-1,d,d+1)$. We give a new method to study lower bounds for these three codes in the circulant graphs using suitable grids. Moreover, we show that these bounds are attained for infinitely many parameters $n$ and $d$. In addition, new approaches are provided which give the exact values for the optimal self-identifying codes in $C_n(1,3)$ and $C_n(1,4).$

Citations (6)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.