این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Global Analysis and Discrete Mathematics، جلد ۸، شماره ۲، صفحات ۱۳۳-۱۳۷
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی metric dimension of $C_n(1‎, ‎2‎, ‎3)$ for $n equiv 0 pmod{6}$
چکیده انگلیسی مقاله The metric dimension of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a metric basis for $G$ and written $dim(G)=Vert BVert$. We have solved an open problem which shows dimension of circulant graph, $dim(C_n(1,2,3))=4, n equiv 0 pmod{6}$. To prove this result, we employ a combination of combinatorial techniques, including distance-based analysis and structural properties of circulant graphs, to carefully analyze the relationship between the graphs structure and its metric dimension. The solution not only answers a previously unresolved question in graph theory but also provides valuable insights into the metric dimensions of more general classes of graphs, particularly in network theory, where understanding the metric dimension is essential for applications in sensor networks, graph-based data storage, and network routing. This work lays the groundwork for future research on the metric dimensions of other families of graphs and has potential applications in optimizing communication and sensor placement in large-scale networks.
کلیدواژه‌های انگلیسی مقاله Metric dimension,resolving set,metric basis,circulant graph
نویسندگان مقاله Mostafa Mohagheghi Nejhad |
Adib Mazandaran Institute of Higher Education, Sari, Iran.

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