Document Type
Article
Date of Original Version
1-1-2018
Abstract
The neighborhood degree list (NDL) is a graph invariant that refines information given by the degree sequence and joint degree matrix of a graph and is useful in distinguishing graphs having the same degree sequence. We show that the space of realizations of an NDL is connected via a switching operation. We then determine the NDLs that have a unique realization by a labeled graph; the characterization ties these NDLs and their realizations to the threshold graphs and difference graphs.
Publication Title, e.g., Journal
Discrete Mathematics
Volume
341
Issue
1
Citation/Publisher Attribution
Barrus, Michael D., and Elizabeth A. Donovan. "Neighborhood degree lists of graphs." Discrete Mathematics 341, 1 (2018): 175-183. doi: 10.1016/j.disc.2017.08.027.
Author Manuscript
This is a pre-publication author manuscript of the final, published article.
Terms of Use
This article is made available under the terms and conditions applicable
towards Open Access Policy Articles, as set forth in our Terms of Use.
