Browsing by Author "เฉลิมพงศ์ วรวรรโณทัย"
Now showing items 1-6 of 6
-
Effect of an edge subdivision on game domination numbers
Collection: Theses (Master's degree) - Mathematics / วิทยานิพนธ์ – คณิตศาสตร์Type: ThesisPakanun DOKYEESUN; ภคนันท์ ดอกยี่สุ่น; Chalermpong Worawannotai; เฉลิมพงศ์ วรวรรโณทัย; Silpakorn University. Science (Silpakorn University, 12/6/2020) -
Effect of vertex-removal on game total domination numbers
Collection: Theses (Master's degree) - Mathematics / วิทยานิพนธ์ – คณิตศาสตร์Type: ThesisKarnchana CHAROENSITTHICHAI; กาญจนา เจริญสิทธิชัย; Chalermpong Worawannotai; เฉลิมพงศ์ วรวรรโณทัย; Silpakorn University. Science (Silpakorn University, 25/11/2022) -
Feasibility of distance-regular graphs
Collection: Theses (Ph.D) - Mathematics ดุษฎีนิพนธ์ - คณิตศาสตร์Type: ThesisSupalak SUMALROJ; สุภลักษณ์ สุมาลย์โรจน์; Chalermpong Worawannotai; เฉลิมพงศ์ วรวรรโณทัย; Silpakorn University. Science (Silpakorn University, 12/7/2019)The problem of deciding whether a distance-regular graph with a given intersection array exists is a widely studied topic in distance-regular graphs. In 1989 Brouwer, Cohen and Neumaier have compiled a list of intersection ... -
Game domination numbers of a disjoint union of chains and cycles of complete graphs
Collection: Theses (Master's degree) - Mathematics / วิทยานิพนธ์ – คณิตศาสตร์Type: ThesisNattakritta CHANTARACHADA; ณัฐกฤตา ฉันทรัชดา; Chalermpong Worawannotai; เฉลิมพงศ์ วรวรรโณทัย; Silpakorn University. Science (Silpakorn University, 18/6/2021)The domination game played on a graph G consists of two players, Dominator and Staller, who alternate taking turns choosing a vertex fromG such that whenever a vertex is chosen, at least one additional vertex ... -
GAME DOMINATION NUMBERS OF COMPLETE MULTIPARTITE GRAPHSAND EXTENDED STAR GRAPHS.
Collection: Theses (Master's degree) - Mathematics Study / วิทยานิพนธ์ – คณิตศาสตร์ศึกษาType: ThesisTuntikorn SAWANGSRI; ตันติกร สว่างศรี; Chalermpong Worawannotai; เฉลิมพงศ์ วรวรรโณทัย; Silpakorn University. Science (Silpakorn University, 18/6/2021)A simple graph G consists of a set of vertices and a set of edges connecting between two vertices. In the study of domination on a graph, vertices on the graph are selected; the selected vertices and all vertices that have ... -
Merging in bipartite distance-regular graphs
Collection: Theses (Ph.D) - Mathematics ดุษฎีนิพนธ์ - คณิตศาสตร์Type: ThesisSiwaporn MAMART; ศิวพร มามาตร; Chalermpong Worawannotai; เฉลิมพงศ์ วรวรรโณทัย; Silpakorn University. Science (Silpakorn University, 12/6/2020)Merging the first and third classes in a connected graph is the operation of adding edges between all vertices at distance 3 in the original graph while keeping the original edges.Merging the first m classes in a connected ...