{"id":162,"date":"2021-03-29T11:16:07","date_gmt":"2021-03-29T11:16:07","guid":{"rendered":"https:\/\/blogit.utu.fi\/utudiscretemath\/?p=162"},"modified":"2021-03-29T15:34:13","modified_gmt":"2021-03-29T15:34:13","slug":"6-4-2021-anni-hakanen","status":"publish","type":"post","link":"https:\/\/blogit.utu.fi\/utudiscretemath\/2021\/03\/29\/6-4-2021-anni-hakanen\/","title":{"rendered":"6.4.2021 Anni Hakanen"},"content":{"rendered":"\n<p><strong>Time<\/strong>: 6.4.2021 at 13:00<\/p>\n\n\n\n<p><strong>Speaker<\/strong>: Anni Hakanen, University of Turku<\/p>\n\n\n\n<p><strong>Title<\/strong>: On the Forced Vertices of Resolving Sets and Metric Bases of Graphs<\/p>\n\n\n\n<p><strong>Abstract<\/strong>: A resolving set of a graph is a subset of the vertices which gives a unique combination of distances to each vertex of the graph. Resolving sets can be used to locate vertices in a graph. A resolving set of minimum cardinality is called a metric basis of the graph. In this talk, we will discuss how the concept of a resolving set can be generalised to locate vertex sets instead of individual vertices. Special emphasis is placed on characterising vertices that are necessary to locate vertex sets. A vertex that is in all such resolving sets is called a forced vertex. Forced vertices do not exist for resolving sets that can locate one vertex at a time. However, we can define a similar concept for the metric bases of graphs.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Time: 6.4.2021 at 13:00 Speaker: Anni Hakanen, University of Turku Title: On the Forced Vertices of Resolving Sets and Metric Bases of Graphs Abstract: A resolving set of a graph is a subset of the vertices which gives a unique combination of distances to each vertex of the graph. Resolving sets can be used to [&hellip;]<\/p>\n","protected":false},"author":928,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[],"class_list":["post-162","post","type-post","status-publish","format-standard","hentry","category-session"],"_links":{"self":[{"href":"https:\/\/blogit.utu.fi\/utudiscretemath\/wp-json\/wp\/v2\/posts\/162","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogit.utu.fi\/utudiscretemath\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogit.utu.fi\/utudiscretemath\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogit.utu.fi\/utudiscretemath\/wp-json\/wp\/v2\/users\/928"}],"replies":[{"embeddable":true,"href":"https:\/\/blogit.utu.fi\/utudiscretemath\/wp-json\/wp\/v2\/comments?post=162"}],"version-history":[{"count":4,"href":"https:\/\/blogit.utu.fi\/utudiscretemath\/wp-json\/wp\/v2\/posts\/162\/revisions"}],"predecessor-version":[{"id":177,"href":"https:\/\/blogit.utu.fi\/utudiscretemath\/wp-json\/wp\/v2\/posts\/162\/revisions\/177"}],"wp:attachment":[{"href":"https:\/\/blogit.utu.fi\/utudiscretemath\/wp-json\/wp\/v2\/media?parent=162"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogit.utu.fi\/utudiscretemath\/wp-json\/wp\/v2\/categories?post=162"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogit.utu.fi\/utudiscretemath\/wp-json\/wp\/v2\/tags?post=162"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}