The Neighbor Matrix: Generalizing A Graph’s Degree Sequence
Roginski, Jonathan W.
MetadataShow full item record
• “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
Accepted for publication in the Journal for Combinatorial Mathematics and Combinatorial Computing
RightsThis 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.