Merging in bipartite distance-regular graphs

Please use this identifier to cite or link to this item: http://ithesis-ir.su.ac.th/dspace/handle/123456789/2423

Full metadata record

DC Field	Value	Language
dc.contributor	Siwaporn MAMART	en
dc.contributor	ศิวพร มามาตร	th
dc.contributor.advisor	Chalermpong Worawannotai	en
dc.contributor.advisor	เฉลิมพงศ์ วรวรรโณทัย	th
dc.contributor.other	Silpakorn University. Science	en
dc.date.accessioned	2020-01-06T05:54:01Z	-
dc.date.available	2020-01-06T05:54:01Z	-
dc.date.issued	12/6/2020
dc.identifier.uri	http://ithesis-ir.su.ac.th/dspace/handle/123456789/2423	-
dc.description	Doctor of Philosophy (Ph.D.)	en
dc.description	ปรัชญาดุษฎีบัณฑิต (ปร.ด.)	th
dc.description.abstract	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 graph is joining all the pairs of vertices with distance at most m in the graph with edges. In this paper, wedetermine when merging the first and third classes in a bipartite distance-regular graph produces a distance-regular graph. We also determine when merging the first m classes in a bipartite distance-regular graph produces a distance-regular graph.	en
dc.description.abstract	-	th
dc.language.iso	en
dc.publisher	Silpakorn University
dc.rights	Silpakorn University
dc.subject	distance-regular graph	en
dc.subject	bipartite	en
dc.subject	merging	en
dc.subject.classification	Mathematics	en
dc.title	Merging in bipartite distance-regular graphs	en
dc.title	การผนวกในกราฟสองส่วนระยะทางปรกติ	th
dc.type	Thesis	en
dc.type	วิทยานิพนธ์	th
Appears in Collections:	Science

Files in This Item:

File	Description	Size	Format
56305801.pdf		5.75 MB	Adobe PDF	View/Open

Show simple item record

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets