Seton Hall University

output

20142023

most citedFunctional Automata - Formal Languages for Computer Science Students

20 citations

researchers with a paper here

Marco T. Morazán3 profiles9 · h 8
Alexander Rodriguez1
Jack Howard1
Jonathan Cutler1
Josephine A. Des Rosiers1 · h 2
Joshua M. Schappel1 · h 1
Joshua Steier1 · h 1
Kalani Hettiarachchilage1
Nathan Kahl1
Neel Haldolaarachchige1
Rosario Antunez1
S. Mahashabde1 · h 1

collaborating institutions

Bergen Community CollegeUS1 paper
City College of New YorkUS1 paper
College of Staten IslandUS1 paper
Montclair State UniversityUS1 paper

Showing math.COShow all

2 papers · 1 filter

math.CO2019

On the Degree Sequences of Multigraphs with Edge Additions and Deletions

Joshua Steier

The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs.…

math.CO2014

A note on the values of independence polynomials at $- 1$

Jonathan Cutler, Nathan Kahl

The independence polynomial $I (G; x)$ of a graph $G$ is $I (G; x) = \sum_{k = 1}^{α (G)} s_{k} x^{k}$ , where $s_{k}$ is the number of independent sets in $G$ of size $k$ . The decycling number of…

On the Degree Sequences of Multigraphs with Edge Additions and Deletions

A note on the values of independence polynomials at −1

A note on the values of independence polynomials at $- 1$