Graph codes and a definition of structural similarity

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

A succinct linear notation system to encode the structure of a graph is exemplified. The notation requires a prior canonical numbering of the graph nodes based on the lengths of a longest path and path branches, and uses locants to designate branch positions and cyclicity. An algorithm and computer program to obtain the longest paths and a spanning tree containing a longest path is described. An index which measures the similarity of a pair of graphs is defined based on a comparison of their linear codes. © 1988.

Cite

CITATION STYLE

APA

Herndon, W. C. (1988). Graph codes and a definition of structural similarity. Computers and Mathematics with Applications, 15(4), 303–309. https://doi.org/10.1016/0898-1221(88)90216-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free