Using k-Mix-Neighborhood Subdigraphs to Compute Canonical Labelings of Digraphs
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, 100876 Beijing, China
School of Computer and Information Engineering, Beijing Technology and Business University, 100048 Beijing, China
Author to whom correspondence should be addressed.
Academic Editors: Raúl Alcaraz Martínez and Kevin H. Knuth
Received: 18 October 2016 / Revised: 25 December 2016 / Accepted: 15 February 2017 / Published: 22 February 2017
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 its complement graph. It systematically examines the link between computing the canonical labeling of a digraph and the k
-neighborhood and k
-mix-neighborhood subdigraphs. To facilitate the presentation, it introduces several concepts including mix diffusion outdegree sequence
and entire mix diffusion outdegree sequences
. For each node in a digraph G
, it assigns an attribute m_NearestNode
to enhance the accuracy of calculating canonical labeling. The four theorems proved here demonstrate how to determine the first nodes added into
. Further, the other two theorems stated below deal with identifying the second nodes added into
. When computing
already contains the first i
, Diffusion Theorem provides a guideline on how to choose the subsequent node of
. Besides, the Mix Diffusion Theorem shows that the selection of the
th vertex of
is from the open mix-neighborhood subdigraph
of the nodes set
. It also offers two theorems to calculate the
of the disconnected digraphs. The four algorithms implemented in it illustrate how to calculate
of a digraph. Through software testing, the correctness of our algorithms is preliminarily verified. Our method can be utilized to mine the frequent subdigraph. We also guess that if there exists a vertex
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
Scifeed alert for new publications
Never miss any articles
matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
Define your Scifeed now
Share & Cite This Article
MDPI and ACS Style
Hao, J.; Gong, Y.; Wang, Y.; Tan, L.; Sun, J. Using k-Mix-Neighborhood Subdigraphs to Compute Canonical Labelings of Digraphs. Entropy 2017, 19, 79.
Hao J, Gong Y, Wang Y, Tan L, Sun J. Using k-Mix-Neighborhood Subdigraphs to Compute Canonical Labelings of Digraphs. Entropy. 2017; 19(2):79.
Hao, Jianqiang; Gong, Yunzhan; Wang, Yawen; Tan, Li; Sun, Jianzhi. 2017. "Using k-Mix-Neighborhood Subdigraphs to Compute Canonical Labelings of Digraphs." Entropy 19, no. 2: 79.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.