Wei-Ling Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wei-Ling Yang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Fu-Ji Zhang
School of Mathematical Sciences, Xiamen University, Xiamen, China
1 shared publication- Fuji Zhang
Xiamen University
1 shared publication - Gang Zhang
School of Mathematical Sciences Xiamen University 361005 Xiamen Fujian P.R. China
1 shared publication - Xian'An Jin
School of Mathematical Sciences, Xiamen University, Xiamen, People’s Republic of China
1 shared publication Xian-An Jin
School of Mathematical Sciences, Xiamen University, Xiamen, China
1 shared publicationYuefen Cao
School of Sciences, Jimei University, Fujian, China
1 shared publication
Latest Publications
- Open Access
Isolation partitions in graphs
Let $G$ be a graph and $k \geq 3$ an integer. A subset $D \subseteq V(G)$ is a $k$-clique (resp., cycle) isolating set of $G$ if $G-N[D]$ contains no $k$-clique (resp., cycle). In this paper, we prove that every connected graph with maximum degree at most $k$, except $k$-clique, can be partitioned into $k+1$ disjoint $k$-clique isolating sets, and that every connected claw-free subcubic graph, except 3-cycle, can be partitioned into four disjoint cycle isolating sets. As a consequence of the first result, every $k$-regular graph can be partitioned into $k+1$ disjoint $k$-clique isolating sets.Open AccessIsolation partitions in graphs
Let $G$ be a graph and $k \geq 3$ an integer. A subset $D \subseteq V(G)$ is a $k$-clique (resp., cycle) isolating set of $G$ if $G-N[D]$ contains no $k$-clique (resp., cycle). In this paper, we prove that every connected graph with maximum degree at most $k$, except $k$-clique, can be partitioned into $k+1$ disjoint $k$-clique isolating sets, and that every connected claw-free subcubic graph, except 3-cycle, can be partitioned into four disjoint cycle isolating sets. As a consequence of the first result, every $k$-regular graph can be partitioned into $k+1$ disjoint $k$-clique isolating sets. - 8 October 2021
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 37 (4) , 706-716
Line Graph Links
- 8 October 2021
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 37 (4) , 706-716
Line Graph Links
- 1 July 2021
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 37 (3) , 485-494
Hosoya and Merrifleld-Simmons Indices in Random Polyphenyl Chains
- 1 July 2021
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 37 (3) , 485-494
Hosoya and Merrifleld-Simmons Indices in Random Polyphenyl Chains
- 14 October 2016
- Published by Taylor & Francis in Polycyclic Aromatic Compounds
- Vol. 37 (1) , 1-23
Extremal Polygonal Chains Concerning Merrified-Simmons Index
Denote by the set of h-polygonal chains with n congruent regular h-polygons (h ⩾ 6). For any , let ik(An) be the numbers of k-independent sets of An. In this article, we show that ik(Z2n) ⩾ ik(An) ⩾ ik(Z1n) for any k ⩾ 0, with the equalities on the left holding for all k only if An = Z2n, and the equalities on the right holding for all k only if An = Z1n, where Z1n and Z2n are extremal chains of type one and type two (their definitions are given in the main text), respectively. Thus, we extend the main results of ( 7 Zhang, L. , and Zhang, F. “Extremal Hexagonal Chains Concerning k-matchings and k-independent Sets.” Journal of Mathematical Chemistry 27 (2000): 319–29. [Crossref], [Web of Science ®] , [Google Scholar] ) to a more general case.
- 14 October 2016
- Published by Taylor & Francis in Polycyclic Aromatic Compounds
- Vol. 37 (1) , 1-23
Extremal Polygonal Chains Concerning Merrified-Simmons Index
Denote by the set of h-polygonal chains with n congruent regular h-polygons (h ⩾ 6). For any , let ik(An) be the numbers of k-independent sets of An. In this article, we show that ik(Z2n) ⩾ ik(An) ⩾ ik(Z1n) for any k ⩾ 0, with the equalities on the left holding for all k only if An = Z2n, and the equalities on the right holding for all k only if An = Z1n, where Z1n and Z2n are extremal chains of type one and type two (their definitions are given in the main text), respectively. Thus, we extend the main results of ( 7 Zhang, L. , and Zhang, F. “Extremal Hexagonal Chains Concerning k-matchings and k-independent Sets.” Journal of Mathematical Chemistry 27 (2000): 319–29. [Crossref], [Web of Science ®] , [Google Scholar] ) to a more general case.