Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product
Publish place: Transactions on Combinatorics، Vol: 9، Issue: 1
Publish Year: 1399
نوع سند: مقاله ژورنالی
زبان: English
View: 178
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_COMB-9-1_003
تاریخ نمایه سازی: 14 اردیبهشت 1400
Abstract:
Metric dimension and defensive $k$-alliance number are two distance-based graph invariants which have applications in robot navigation, quantitative analysis of secondary RNA structures, national defense and fault-tolerant computing. In this paper, some bounds for metric dimension and defensive $k$-alliance of deleted lexicographic product of graphs are presented. We also show that the bounds are sharp.
Authors
Kinkar Chandra Das
Sungkyunkwan University
Mostafa Tavakoli
Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad