The Neighbor Matrix: Generalizing A Graph’s Degree Sequence

Thumbnail
Download
Download Record
Author
Roginski, Jonathan W.
Date
2017
Advisor
Gera, Ralucca
Metadata
Show full item record
Abstract
“Who:” The Neighbor Matrix; What does it do? Describes graph topology; Where: Globally – across the entire graph; When: All graphs; Why: Compact structure containing at least 11 graph invariants and topological descriptors; How: Enumerates the number of neighbors each vertex has at every distance present in the graph
Description
Accepted for publication in the Journal for Combinatorial Mathematics and Combinatorial Computing
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
URI
https://hdl.handle.net/10945/65319
Collections