VGU RESEARCH REPOSITORY
Please use this identifier to cite or link to this item:
https://epub.vgu.edu.vn/handle/dlibvgu/961| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nguyen Hai Duc | en_US |
| dc.date.accessioned | 2020-07-16T03:48:57Z | - |
| dc.date.accessioned | 2020-07-16T03:49:00Z | - |
| dc.date.available | 2020-07-16T03:48:57Z | - |
| dc.date.available | 2020-07-16T03:49:00Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.uri | http://epub.vgu.edu.vn/handle/dlibvgu/961 | - |
| dc.description.abstract | In this thesis, we focus on computing the rank of divisors on two complete graphs appended at a common vertex. We come up with a formula that computes this rank in term of the rank of divisors on complete graph components. Although the formula is in an optimization form, it is good enough for us to compute this rank in polynomial time. Moreover, it is then used to study the length for the rank as well as the lengths of the first and the last plateaux of the rank function of divisors with the same reduced divisor and the number of chips at the sink as a variable. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Vietnamese-German University | - |
| dc.rights | Attribution-NonCommercial 4.0 International | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc/4.0/ | * |
| dc.subject | Rank of divisors | en_US |
| dc.subject | Complete graphs, | en_US |
| dc.subject | Plateaux of the rank | en_US |
| dc.title | Rank of divisors on some particular graphs | en_US |
| dc.type | Thesis | en_US |
| item.grantfulltext | restricted | - |
| item.fulltext | With Fulltext | - |
| item.languageiso639-1 | other | - |
| Appears in Collections: | Computer Science (CS) Computer Science (CS) | |
Files in This Item:
| File | Description | Size | Format | Existing users please Login |
|---|---|---|---|---|
| Rank of divisors on some particular graphs.pdf | 875.25 kB | Adobe PDF |
Page view(s)
100
checked on Oct 15, 2025
Download(s)
24
checked on Oct 15, 2025
Google ScholarTM
Check
This item is licensed under a Creative Commons License