Skip to main
Math equations
George Mason University
News

Degree Sequences with Forced Edges

MARCH 9, 2018
Brian Cloteaux, NIST Speaker:

Title: Degree Sequences with Forced Edges

Abstract: For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none as forbidden. These edges have applications in areas such as random graph generation based on a given degree sequence and degree sequence packing. In this talk, we examine some of structural implications for graphs whose degree sequences contain either forced or forbidden edges. Among the things we will see, we see some tools to reason about degree sequence containing forced or forbidden edges and how these edges affect the diameter and connectivity for the realizations of these sequences.

Time: Friday, March 9, 2018, 3:30-4:20 p.m.

Place: Exploratory Hall, room 4106

Refreshments will be served at 3:00 p.m.

* The programs and services offered by George Mason University are open to all who seek them. George Mason does not discriminate on the basis of race, color, religion, ethnic national origin (including shared ancestry and/or ethnic characteristics), sex, disability, military status (including veteran status), sexual orientation, gender identity, gender expression, age, marital status, pregnancy status, genetic information, or any other characteristic protected by law. After an initial review of its policies and practices, the university affirms its commitment to meet all federal mandates as articulated in federal law, as well as recent executive orders and federal agency directives.