Show simple item record

dc.contributor.advisorNaimi, Ramin
dc.contributor.authorShaw, Jeffrey
dc.date.accessioned2020-08-13T14:57:28Z
dc.date.available2020-08-13T14:57:28Z
dc.date.issued2005-01-01 0:00
dc.identifier.urihttps://scholar.oxy.edu/handle/20.500.12711/1025
dc.description.abstractA graph is a set of vertices (points) and edges (lines) connecting some of the vertices to each other. We study how different two graphs are by measuring various "distances" between them, e.g., the number of edges that must be added and removed to transform one graph into another. We also construct counterexamples to two conjectures in this field, dating back to 1990 and 1997.
dc.description.sponsorshipFord Research Endowment
dc.titleOn Induced Subgraphs of Johnson Graphs and Move, Rotation, and Jump Graphs
dc.typearticle
dc.abstract.formathtml
dc.description.departmentmath
dc.source.issueurc_student
dc.identifier.legacyhttps://scholar.oxy.edu/urc_student/1024
dc.source.statuspublished


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record