Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Q-matrix: an algebraic formulation for the analysis and visual characterization of network graphs

Published

Author(s)

Roldan Pozo

Abstract

Given an undirected network, we describe a two- dimensional graphical measure based on the con- nected component distribution of its degree-limited subgraphs. This process yields an unambiguous vi- sual portrait which reveals important network proper- ties. It can be used as a classification tool, as graphs from similar application areas have striking similari- ties. It can also be used as an efficient algorithm to demonstrate graph non-isomorphism for large graphs with identical degree distributions. Finally, it can be used as an analysis tool to help distinguish real-world networks form their synthetic counterparts.
Citation
Journal of Research (NIST JRES) -
Volume
121

Keywords

graph theory, degree-limited subgraphs, percolation, network measures, network classification

Citation

Pozo, R. (2016), Q-matrix: an algebraic formulation for the analysis and visual characterization of network graphs, Journal of Research (NIST JRES), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=915072 (Accessed June 13, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created February 8, 2016, Updated January 27, 2020