Xue-Gang Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Xue-Gang Chen has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Liang Sun
Beijing Institute of Technology
9 shared publications- Hua-Ming Xing
Langfang Teachers College
7 shared publications - Moo Young Sohn
Changwon National University
6 shared publications De-Xiang Ma
Shandong University of Science and Technology
4 shared publicationsWai Chee Shiu
4 shared publicationsFu-Tao Hu
Changwon National University
2 shared publications
Latest Publications
- Open Access
- 29 December 2021
- Published by MDPI AG in Applied Sciences
- Vol. 12 (1) , 304
A Note on “Wiener Index of a Fuzzy Graph and Application to Illegal Immigration Networks”
Connectivity parameters have an important role in the study of communication networks. Wiener index is such a parameter with several applications in networking, facility location, cryptology, chemistry, and molecular biology, etc. In this paper, we show two notes related to the Wiener index of a fuzzy graph. First, we argue that Theorem 3.10 in the paper “Wiener index of a fuzzy graph and application to illegal immigration networks, Fuzzy Sets and Syst. 384 (2020) 132–147” is not correct. We give a correct statement of Theorem 3.10. Second, by using a new operator on matrix, we propose a simple and polynomial-time algorithm to compute the Wiener index of a fuzzy graph.
- 29 December 2021
- Published by MDPI AG in Applied Sciences
- Vol. 12 (1) , 304
Open AccessA Note on “Wiener Index of a Fuzzy Graph and Application to Illegal Immigration Networks”
Connectivity parameters have an important role in the study of communication networks. Wiener index is such a parameter with several applications in networking, facility location, cryptology, chemistry, and molecular biology, etc. In this paper, we show two notes related to the Wiener index of a fuzzy graph. First, we argue that Theorem 3.10 in the paper “Wiener index of a fuzzy graph and application to illegal immigration networks, Fuzzy Sets and Syst. 384 (2020) 132–147” is not correct. We give a correct statement of Theorem 3.10. Second, by using a new operator on matrix, we propose a simple and polynomial-time algorithm to compute the Wiener index of a fuzzy graph.
- 11 September 2020
- Published by Springer Nature in Proceedings - Mathematical Sciences
- Vol. 130 (1) , 1-6
The exact 2-domination number of generalized Petersen graphs
- 11 September 2020
- Published by Springer Nature in Proceedings - Mathematical Sciences
- Vol. 130 (1) , 1-6
The exact 2-domination number of generalized Petersen graphs
- 1 March 2020
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 70 (1) , 205-212
A Note on the Double Roman Domination Number of Graphs
For a graph G = (V, E), a double Roman dominating function is a function f: V -> {0, 1, 2, 3} having the property that if f (v) = 0, then the vertex v must have at least two neighbors assigned 2 under f or one neighbor with f (w) = 3, and if f (v) = 1, then the vertex v must have at least one neighbor with f (w) > 2. The weight of a double Roman dominating function f is the sum f(V)= n-ary sumation v is an element of Vf(v). The minimum weight of a double Roman dominating function on G is called the double Roman domination number of G and is denoted by gamma(dR)(G). In this paper, we establish a new upper bound on the double Roman domination number of graphs. We prove that every connected graph G with minimum degree at least two and G not equal C-5 satisfies the inequality gamma dR(G)<= L1311n. One open question posed by R. A. Beeler et al. has been settled.
- 1 March 2020
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 70 (1) , 205-212
A Note on the Double Roman Domination Number of Graphs
For a graph G = (V, E), a double Roman dominating function is a function f: V -> {0, 1, 2, 3} having the property that if f (v) = 0, then the vertex v must have at least two neighbors assigned 2 under f or one neighbor with f (w) = 3, and if f (v) = 1, then the vertex v must have at least one neighbor with f (w) > 2. The weight of a double Roman dominating function f is the sum f(V)= n-ary sumation v is an element of Vf(v). The minimum weight of a double Roman dominating function on G is called the double Roman domination number of G and is denoted by gamma(dR)(G). In this paper, we establish a new upper bound on the double Roman domination number of graphs. We prove that every connected graph G with minimum degree at least two and G not equal C-5 satisfies the inequality gamma dR(G)<= L1311n. One open question posed by R. A. Beeler et al. has been settled.
- 21 May 2019
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 43 (2) , 1885-1891
On Total Domination and Hop Domination in Diamond-Free Graphs
- 21 May 2019
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 43 (2) , 1885-1891
On Total Domination and Hop Domination in Diamond-Free Graphs
- 1 August 2017
- Published by Elsevier in Discrete Optimization
- Vol. 25, 1-5
A note on independent vertex–edge domination in graphs
- 1 August 2017
- Published by Elsevier in Discrete Optimization
- Vol. 25, 1-5
A note on independent vertex–edge domination in graphs
- 1 January 2017
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 217, 718-721
A note on α-total domination in cubic graphs
- 1 January 2017
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 217, 718-721
A note on α-total domination in cubic graphs
- 30 September 2016
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 41 (4) , 1749-1758
On Efficiently Total Dominatable Digraphs
- 30 September 2016
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 41 (4) , 1749-1758
On Efficiently Total Dominatable Digraphs
- 1 June 2015
- Published by Elsevier in Information Processing Letters
- Vol. 115 (6-8) , 580-581
Downhill domination problem in graphs
- 1 June 2015
- Published by Elsevier in Information Processing Letters
- Vol. 115 (6-8) , 580-581
Downhill domination problem in graphs
- 28 April 2015
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 32 (2) , 608-625
Total and paired domination numbers of $C_m$ C m bundles over a cycle $C_n$ C n- 28 April 2015
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 32 (2) , 608-625
Total and paired domination numbers of $C_m$ C m bundles over a cycle $C_n$ C n- 31 October 2013
- Published by The Korean Mathematical Society in Communications of the Korean Mathematical Society
- Vol. 28 (4) , 857-863
TOTAL DOMINATIONS IN P6-FREE GRAPHS
- 31 October 2013
- Published by The Korean Mathematical Society in Communications of the Korean Mathematical Society
- Vol. 28 (4) , 857-863
TOTAL DOMINATIONS IN P6-FREE GRAPHS