Skip navigation


  • DSpace logo
  • Home
  • Collections
  • Researcher Profile
  • Explore by
    • Researcher Profile
  • VGU library
  • Help
  • User Guide
  • Sign on to:
    • My DSpace
    • Receive email
      updates
    • Edit Account details

VGU RESEARCH REPOSITORY


Please use this identifier to cite or link to this item: https://epub.vgu.edu.vn/handle/dlibvgu/965
Title: A combinatorial approach to gonality divisor
Authors: Nguyen The Viet 
Keywords: Combinatorial approach;Gonality divisor
Issue Date: 2019
Publisher: Vietnamese-German University
Abstract: 
Given a graph G with a divisor that represents a configuration in chip-firing game on G, the gonality of G is the lowest degree of the divisor that reaches all vertices of G [2]. The thesis presents calculations for the gonality of special graphs like fan graphs and flower graphs using the reachability of a divisor. Additionally, an upper bound for the gonality of tree with cycles graphs is given. Finally, we use the reduction rules in [2] to characterize tree wich cycles graphs of gonality 2. By that, the order of applying reduction rules on tree with cycles is determined and checking the compatibility on cycles is much more simple. Algorithms to move chips on tree and cycle are shown.
URI(1): http://epub.vgu.edu.vn/handle/dlibvgu/965
Rights: Attribution-NonCommercial 4.0 International
Appears in Collections:Computer Science (CS)

Files in This Item:
File Description SizeFormat Existing users please Login
A combinatorial approach to gonality divisor.pdf1.31 MBAdobe PDF
Show full item record

Page view(s)

78
checked on Nov 15, 2025

Download(s)

17
checked on Nov 15, 2025

Google ScholarTM

Check


This item is licensed under a Creative Commons License Creative Commons

© Copyright 2020 by Vietnamese - German University Library.
Add: Ring road 4, Quarter 4, Thoi Hoa Ward, Ben Cat City, Binh Duong Province
Tel.:(0274) 222 0990. Ext.: 70206