آمار
| تعداد نشریات | 5 |
| تعداد شمارهها | 116 |
| تعداد مقالات | 1,363 |
| تعداد مشاهده مقاله | 1,365,565 |
| تعداد دریافت فایل اصل مقاله | 1,323,272 |
On the Identification Numbers of Lobster Graphs | ||
| Communications in Combinatorics and Optimization | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 27 تیر 1404 | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2025.29836.2183 | ||
| نویسندگان | ||
| Mark Anthony C. Tolentino* ؛ Luis Jr. S. Silvestre؛ Richwell T. Chan Sim؛ Amir Jann Erikson E. Diga؛ Althea Julia R. Loyola | ||
| Department of Mathematics, Ateneo de Manila University, Quezon City, Philippines | ||
| چکیده | ||
| Given a nontrivial connected undirected graph $G$ with diameter $d$, a vertex coloring $c$ of $G$ that uses only the colors red and white induces, for each $v \in V(G)$, the $d$-vector $\vec{d}(v) = [a_1 a_2 \cdots a_d]$, where each $a_i$ is equal to the number of red vertices of distance $i$ from $v$. Then $c$ is called an ID-coloring of $G$ if $\vec{d}(v) \neq \vec{d}(w)$ for all distinct $v,w \in V(G)$. If $G$ has at least one ID-coloring, then it is called an ID-graph and its identification number $ID(G)$ is defined to be the minimum number of red vertices among all ID-colorings of $G$. The notions of ID-colorings and identification number have been shown to be equivalent to the notions of multiset resolving sets and multiset dimension, respectively. Previous works on this topic have focused on characterizing ID-caterpillars and ID-lobsters and on the identification numbers of some ID-caterpillars. In this paper, we focus on the identification numbers of ID-lobsters. Specifically, we establish a sharp lower bound for the identification number of all ID-lobsters. Furthermore, we characterize and determine the identification numbers of all uniform ID-lobsters. | ||
| کلیدواژهها | ||
| identification colorings؛ multiset dimension؛ lobster graph | ||
|
آمار تعداد مشاهده مقاله: 5 |
||