Huixin Yin

All articles published by MDPI are made immediately available worldwide under an open access license. No special permission is required to reuse all or part of the article published by MDPI, including figures and tables. For articles published under an open access Creative Common CC BY license, any part of the article may be reused without permission provided that the original article is clearly cited. For more information, please refer to https://www.mdpi.com/openaccess.

This is an early access version, the complete PDF, HTML, and XML versions will be available soon. Open AccessArticle by , * and College of Information Science and Engineering, Xinjiang University, Urumqi 830046, China * Author to whom correspondence should be addressed.

3.1. Block Decomposition of C ( G ) and General Lemmas A leaf block in a graph G is a maximal 2-connected subgraph of G containing exactly one cut vertex of G. Let B 1 be a leaf block of C ( G ) . We use a ( B 1 ) to denote the cut vertex of C ( G ) connecting B 1 and the remaining part in C ( G ) . We call e an interior edge in B 1 if e is not incident with a ( B 1 ) . We call v an interior vertex in B 1 if v ≠ a ( B 1 ) .