پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 161 |
| تعداد شماره‌ها | 6,532 |
| تعداد مقالات | 70,502 |
| تعداد مشاهده مقاله | 124,116,719 |
| تعداد دریافت فایل اصل مقاله | 97,221,476 |
Metric and partition dimension of flower and pencil graphs | ||
| Journal of Algorithms and Computation | ||
| مقاله 7، دوره 56، شماره 1، آبان 2024، صفحه 83-99 اصل مقاله (1.44 M) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2024.360428.1198 | ||
| نویسندگان | ||
| Kristiana Wijaya* 1؛ Ulil Abshari2؛ Via Mufidatud Diniyah2؛ Ikhsanul Halikin2؛ Kusbudiono Kusbudiono2 | ||
| 1Graph and Algebra Research Group Department of Mathematics Faculty of MIPA Universitas Jember | ||
| 2Graph and Algebra Research Group Department of Mathematics Faculty of MIPA Universitas Jember | ||
| چکیده | ||
| This paper is about metric and partition dimension of a flower and a pencil graph. A metric dimension of G, denoted by dim(G), is the minimum cardinality of any resolving set of G. A partition dimension of G, denoted by pd(G), is the minimum number of sets in any resolving k-ordered partition for G. Here we give the exact value of the metric dimension of a flower graph fm×n for m ∈ {3, 4} and a pencil graph Pcm for any integer m ≥ 2. We also give the partition dimension of fm×n for m ∈ {3, 4, 5} and Pcm for any integer m ≥ 2. | ||
| کلیدواژه‌ها | ||
| Distance؛ resolving set؛ resolving $k$-ordered partition؛ ordered $k$-tupple؛ connected | ||
|
آمار تعداد مشاهده مقاله: 41 تعداد دریافت فایل اصل مقاله: 81 |
||