AMS Sectional Meeting AMS Special Session

Current as of Friday, April 1, 2016 03:30:08

---

Program  ·  Deadlines  ·  Registration/Housing/Etc.
Inquiries: meet@ams.org

---

Spring Eastern Sectional Meeting
State University of New York at Stony Brook, Stony Brook, NY
March 19-20, 2016 (Saturday - Sunday)
Meeting #1118

Associate secretaries:

Steven H Weintraub, AMS shw2@lehigh.edu

---

Special Session on Graph Vulnerability Parameters and their Role in Network Analysis

• Saturday March 19, 2016, 9:30 a.m.-10:50 a.m.
  Special Session on Graph Vulnerability Parameters and their Role in Network Analysis, I
  Room 226, Frey Hall
  Organizers:
  Michael Yatauro, Pennsylvania State University-Brandywine mry3@psu.edu
  

  • 9:30 a.m.
    Extremal cop-win graphs.
    Kerry Ojakian*, BCC of CUNY
    (1118-05-165)
  • 10:00 a.m.
    A proof of the Roller Coaster Conjecture.
    Jonathan Cutler*, Montclair State University
    Luke Pebody, London, United Kingdom
    (1118-05-171)
  • 10:30 a.m.
    On the values of independence polynomials at $-1$.
    Jonathan Cutler, Montclair State University
    Nathan Kahl*, Seton Hall University
    (1118-05-212)
• Saturday March 19, 2016, 3:00 p.m.-5:50 p.m.
  Special Session on Graph Vulnerability Parameters and their Role in Network Analysis, II
  Room 226, Frey Hall
  Organizers:
  Michael Yatauro, Pennsylvania State University-Brandywine mry3@psu.edu
  

  • 3:00 p.m.
    A polynomial time algorithm for computing neighbor component order edge connectivity of arbitrary unicycles.
    Monika M. Heinig*, Stevens Institute of Technology
    Daniel Gross, Seton Hall University
    John T. Saccoman, Seton Hall University
    Charles Suffel, Stevens Institute of Technology
    (1118-05-236)
  • 3:30 p.m.
    Uniform optimality results for trees in the Neighbor Component Order Edge Connectivity Network Model.
    Michael R Yatauro*, Penn State University
    Monika Heinig, Stevens Institute of Technology
    (1118-05-191)
  • 4:00 p.m.
    On a relianility model associated with the edge domination number for trees.
    Charles L Suffel*, Stevens Institure of Technology
    Monika Heinig, Stevens Institute of Technology
    Daniel Gross, Seton Hall University
    John Saccoman, Seton Hall University
    Michael Yaturo, Penn State
    (1118-05-216)
  • 4:30 p.m.
    Diameter-constrained network reliability, a generalization of the classical reliability.
    Louis Petingi*, College of Staten Island, City UNiversity of New York
    (1118-05-83)
  • 5:00 p.m.
    A Survey of Laplacian Integral Graphs and Multigraphs.
    John T Saccoman*, Seton Hall University
    (1118-05-235)
  • 5:30 p.m.
    Best Monotone Theorem for 1-binding implies 1-factor.
    Aori Nevo*, Stevens Institute of Technology
    Douglas Bauer, Stevens Institute of Technology
    Edward Schmeichel, San Jose State University
    (1118-05-71)

Inquiries: meet@ams.org

---