Search Results - "Deng, Xingchao"

Simulation of spring discharge using graph neural networks at Niangziguan Springs, China by Gai, Yujing, Wang, Mingyang, Wu, Yue, Wang, Enzhi, Deng, Xingchao, Liu, Yan, Jim Yeh, Tian-Chyi, Hao, Yonghong

“…•Graph neural networks (GNN) model is established to simulate spring discharge.•The model is applied to Niangziguan Springs, the max karst spring in North…”
Get full text

A note on nonlocal metric dimension of some networks by Xiong, Wenjing, Deng, Xingchao

Get full text

On the distance-edge-monitoring numbers of graphs by Yang, Chenxu, Klasing, Ralf, Mao, Yaping, Deng, Xingchao

“…Foucaud et al. (2022) recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. For a set M of vertices…”
Get full text

Hepatic metabolism-related effects of polysaccharides from red kidney bean and small black soybean on type 2 diabetes by Bai, Zhouya, Huang, Xiaojun, Wu, Guangjie, Zhou, Yujia, Deng, Xingchao, Yang, Jingrui, Yin, Junyi, Nie, Shaoping

“…•Crude polysaccharides from two legumes (RK, SB) showed hepatic protection.•Two pure polysaccharides (RKPH and SBPH) were identified the key…”
Get full text

On the distance-edge-monitoring numbers of graphs by Yang, Chenxu, Klasing, Ralf, Mao, Yaping, Deng, Xingchao

“…Foucaud et al. [Discrete Appl. Math. 319 (2022), 424-438] recently introduced and initiated the study of a new graph-theoretic concept in the area of network…”
Get full text

A note on a conjecture of star chromatic index for outerplanar graphs by Deng, Xingchao, Yao, Qingye, Zhang, Yanbing, Cui, Xudong

“…A star edge coloring of a graph G is a proper edge coloring of G without bichromatic paths or cycles of length four. The star chromatic index, χst′(G), of G is…”
Get full text

Distance-edge-monitoring numbers of some related pseudo wheel networks by Yang, Chenxu, Deng, Xingchao, Ji, Zhen, Li, Wen

“…For a set M of vertices and an edge e of a graph G, let $ P_G(M, e) $ P G ( M , e ) be the set of the pair $ (x, y) $ ( x , y ) with a vertex x of M and a…”
Get full text

The (d, 1)-total labelling of Sierpin´ski-like graphs by Deng, Xingchao, Shao, Zhiwei, Zhang, Huan, Yang, Weihua

“…A (d, 1)-total labelling of a simple graph G is an assignment of integers to V(G) ∪ E(G) such that any two adjacent vertices of G receive distinct integers,…”
Get full text

The (d, 1)-total labelling of Sierpi n ´ ski-like graphs by Deng, Xingchao, Shao, Zhiwei, Zhang, Huan, Yang, Weihua

Get full text

Algorithm on rainbow connection for maximal outerplanar graphs by Deng, Xingchao, Li, Hengzhe, Yan, Guiying

“…In this paper, we consider rainbow connection number of maximal outerplanar graphs (MOPs) on algorithmic aspect. For the (MOP) G, we give sufficient conditions…”
Get full text

A Note on Semi-coloring of Graphs by Wu, Baoyindureng, Deng, Xingchao, An, Xinhui, Yan, Guiying

“…Semi-coloring is a new type of edge coloring of graphs. In this note, we show that every graph has a semi-coloring. This answers a problem, posed by Daniely…”
Get full text

On the distance-edge-monitoring numbers of graphs by Yang, Chengxu, Klasing, Ralf, Mao, Yaping, Deng, Xingchao

“…Foucaud et al. [Discrete Appl. Math. 319 (2022), 424-438] recently introduced and initiated the study of a new graph-theoretic concept in the area of network…”
Get full text

A note on a conjecture of star chromatic index for outerplanar graphs by Deng, Xingchao, Yao, Qingye, Zhang, Yanbing, Cui, Xudong

“…A star edge coloring of a graph $G$ is a proper edge coloring of $G$ without bichromatic paths or cycles of length four. The it star chromatic index,…”
Get full text

Algorithm on rainbow connection for maximal outerplanar graphs by Deng, Xingchao, Li, Hengzhe, Yan, Guiying

“…In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) $G$, we give sufficient…”
Get full text

Concentration properties of semi-vertex transitive graphs and random bi-coset graphs by Deng, Xingchao, Xiang, Kainan

“…It is well-known that concentrators are sparse graphs of high connectivity, which play a key role in the construction of switching networks; and any…”
Get full text

Rainbow connection of bridgeless outerplanar graphs with small diameters by Deng, Xingchao, Song, He, Su, Guifu, Yang, Weihua

“…In this paper, we investigate rainbow connection number $rc(G)$ of bridgeless outerplanar graphs $G$ with diameter 2 or 3. We proved the following results: If…”
Get full text