Using k-Mix-Neighborhood Subdigraphs to Compute Canonical Labelings of Digraphs
This paper presents a novel theory and method to calculate the canonical labelings of digraphs whose definition is entirely different from the traditional definition of Nauty. It indicates the mutual relationships that exist between the canonical labeling of a digraph and the canonical labeling of i...
Main Authors: | Jianqiang Hao, Yunzhan Gong, Yawen Wang, Li Tan, Jianzhi Sun |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2017-02-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/19/2/79 |
Similar Items
-
Use the <i>K</i>-Neighborhood Subgraphs to Compute Canonical Labelings of Graphs
by: Jianqiang Hao, et al.
Published: (2019-08-01) -
The existence of subdigraphs with orthogonal factorizations in digraphs
by: Sizhong Zhou, et al.
Published: (2021-11-01) -
Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism
by: Anita Abildgaard Sillasen
Published: (2015-03-01) -
Extremal Irregular Digraphs
by: Górska Joanna, et al.
Published: (2018-08-01) -
Networks of Mixed Canonical-Dissipative Systems and Dynamic Hebbian Learning
by: Julio Rodriguez, et al.
Published: (2009-06-01)