Group analysis and numerical approximation of proliferating and maturing cellular populations model | ||
| AUT Journal of Mathematics and Computing | ||
| مقاله 6، دوره 7، شماره 3، پاییز 2026، صفحه 325-335 اصل مقاله (879.64 K) | ||
| نوع مقاله: Original Article | ||
| شناسه دیجیتال (DOI): 10.22060/ajmc.2025.23231.1243 | ||
| نویسندگان | ||
| Mohammad Hadi Noori Eskandari؛ S. Reza Hejazi* ؛ Hamid Erfanian Oraei Dehrokhi | ||
| Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran | ||
| چکیده | ||
| Locating or resolving sets are introduced as a graph-theoretic model of robot navigation and has different applications in diverse areas like network discovery, computer science and chemistry. These applications leads to some graph parameters, like the metric dimension and the adjacency dimension. A subset $S$ of the vertices of a graph $G$ is an adjacency resolving set for $G$ if for each pair of distinct vertices $x, y \in V(G)\setminus S$, there exists $s \in S$ which is adjacent to exactly one of these two vertices. An adjacency resolving set with the minimum cardinality is called an adjacency basis and its cardinality is the adjacency dimension of $G$. Since the problem of computing the adjacency dimension of a graph is NP-hard, finding the adjacency dimension of special classes of graphs or obtaining good bounds on this invariant is valuable. In this paper we determine the adjacency dimension of some famous star related trees. | ||
| کلیدواژهها | ||
| Lie symmetry؛ Jacobi-pesudo-spectral method؛ Delay differential equations | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 669 تعداد دریافت فایل اصل مقاله: 240 |
||