Item

Odd Covers of Graphs

Buchanan, Calum
Citations
Altmetric:
License
License
Abstract
Graphs are abstractions of many networks around us: social networks or the World Wide Web, to name just a couple. For various applications, there is interest in efficiently encoding a graph for a computer. We address a problem which relates to finding a “smallest” matrix with which to encode a graph. The problem, phrased in terms of a social network, is to find the minimum number of clubs that a given group of people can form under the condition that, if two people are friends, they are in an odd number of clubs together, and otherwise in an even number.
Description
Date
2023-01-01
Student Status
Graduate
Journal Title
Journal ISSN
Volume Title
Type of presentation
Poster Presentation
Collections
UVM Student Research Conference
Show all metadata
Research Projects
Organizational Units
Journal Issue
Citation
URI
https://hdl.handle.net/20.500.14849/8572
DOI
Advisor(s)
Puck Rombach
Department
Program/Major
Mathematics
College/School
College of Engineering and Mathematical Sciences
Organization
item.page.researchcategory
Engineering and Math Science
Embedded videos