Use the <i>K</i>-Neighborhood Subgraphs to Compute Canonical Labelings of Graphs

Use the <i>K</i>-Neighborhood Subgraphs to Compute Canonical Labelings of Graphs

This paper puts forward an innovative theory and method to calculate the canonical labelings of graphs that are distinct to <inline-formula> <math display="inline"> <semantics> <mrow> <mi>N</mi> <mi>a</mi> <mi>u</mi> <mi>t&l...

Full description

Bibliographic Details
Main Authors: Jianqiang Hao, Yunzhan Gong, Jianzhi Sun, Li Tan
Format: Article
Language:English
Published: MDPI AG 2019-08-01
Series:Mathematics
Subjects:
canonical labeling
open k-neighborhood subgraph
algorithm
adjacency matrix
diffusion degree sequence
entire diffusion degree sequences
Online Access:https://www.mdpi.com/2227-7390/7/8/690

Internet

https://www.mdpi.com/2227-7390/7/8/690

Similar Items