نمایش مختصر رکورد

dc.contributor.authorAlikhani, Saeiden_US
dc.contributor.authorSoltani, Samanehen_US
dc.date.accessioned1402-04-14T10:03:19Zfa_IR
dc.date.accessioned2023-07-05T10:03:20Z
dc.date.available1402-04-14T10:03:19Zfa_IR
dc.date.available2023-07-05T10:03:20Z
dc.date.issued2023-05-01en_US
dc.date.issued1402-02-11fa_IR
dc.date.submitted2022-08-30en_US
dc.date.submitted1401-06-08fa_IR
dc.identifier.citationAlikhani, Saeid, Soltani, Samaneh. (2023). On the graphs with distinguishing number equal list distinguishing number. Journal of Mahani Mathematical Research Center, 12(2), 411-423. doi: 10.22103/jmmr.2023.20163.1333en_US
dc.identifier.issn2251-7952
dc.identifier.urihttps://dx.doi.org/10.22103/jmmr.2023.20163.1333
dc.identifier.urihttps://jmmrc.uk.ac.ir/article_3600.html
dc.identifier.urihttps://iranjournals.nlai.ir/handle/123456789/1000515
dc.description.abstractThe distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling with $d$ labels that is preserved only by the trivial automorphism. A list assignment to $G$ is an assignment $L = \{L(v)\}_{v\in V (G)}$ of lists of labels to the vertices of $G$. A distinguishing $L$-labeling of $G$ is a distinguishing labeling of $G$ where the label of each vertex $v$ comes from $L(v)$. The list distinguishing number of $G$, $D_l(G)$ is the minimum $k$ such that every list assignment to $G$ in which $|L(v)| = k$ for all $v \in V (G)$ yields a distinguishing $L$-labeling of $G$. In this paper, we determine the list-distinguishing number for two families of graphs. We also characterize graphs with the distinguishing number equal the list distinguishing number. Finally, we show that this characterization works for other list numbers of a graph.en_US
dc.format.extent494
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoen_US
dc.relation.ispartofJournal of Mahani Mathematical Research Centeren_US
dc.relation.isversionofhttps://dx.doi.org/10.22103/jmmr.2023.20163.1333
dc.subjectDistinguishing numberen_US
dc.subjectlist-distinguishing labelingen_US
dc.subjectlist distinguishing chromatic numberen_US
dc.titleOn the graphs with distinguishing number equal list distinguishing numberen_US
dc.typeTexten_US
dc.typeResearch Paperen_US
dc.contributor.departmentDepartment of Mathematical Sciences, Yazd University, Yazd, Iranen_US
dc.contributor.departmentDepartment of Mathematical Sciences, Yazd University, Yazd, Iranen_US
dc.citation.volume12
dc.citation.issue2
dc.citation.spage411
dc.citation.epage423
nlai.contributor.orcid0000-0002-6937-4268


فایل‌های این مورد

Thumbnail

این مورد در مجموعه‌های زیر وجود دارد:

نمایش مختصر رکورد