GCG: Graph Convolutional network and gated recurrent unit method for high-speed train axle temperature forecasting
J Man, H Dong, X Yang, Z Meng, L Jia, Y Qin… - Mechanical Systems and …, 2022 - Elsevier
Nowadays, with the growing scale of high-speed railways and the increasing number of high-
speed trains, the research on train equipment fault diagnosis and health management …
speed trains, the research on train equipment fault diagnosis and health management …
AttGGCN model: A novel multi-sensor fault diagnosis method for high-speed train bogie
J Man, H Dong, L Jia, Y Qin - IEEE Transactions on Intelligent …, 2022 - ieeexplore.ieee.org
The bogie system is a critical system for a high-speed train, which is composed of various
mechanical parts. Therefore, the health of the bogie can directly affect the health of high …
mechanical parts. Therefore, the health of the bogie can directly affect the health of high …
Mutual visibility in graphs
G Di Stefano - Applied Mathematics and Computation, 2022 - Elsevier
Abstract Let G=(V, E) be a graph and P⊆ V a set of points. Two points are mutually visible if
there is a shortest path between them without further points. P is a mutual-visibility set if its …
there is a shortest path between them without further points. P is a mutual-visibility set if its …
The general position number of Cartesian products involving a factor with small diameter
J Tian, K Xu - Applied Mathematics and Computation, 2021 - Elsevier
A vertex subset R of a graph G is called a general position set if any triple V 0⊆ R is non-
geodesic, this is, the three elements of V 0 do not lie on the same geodesic in G. The …
geodesic, this is, the three elements of V 0 do not lie on the same geodesic in G. The …
On the mutual visibility in Cartesian products and triangle-free graphs
Given a graph G=(V (G), E (G)) and a set P⊆ V (G), the following concepts have been
recently introduced:(i) two elements of P are mutually visible if there is a shortest path …
recently introduced:(i) two elements of P are mutually visible if there is a shortest path …
[HTML][HTML] Mutual-visibility in strong products of graphs via total mutual-visibility
Let G be a graph and X⊆ V (G). Then X is a mutual-visibility set if each pair of vertices from
X is connected by a geodesic with no internal vertex in X. The mutual-visibility number μ (G) …
X is connected by a geodesic with no internal vertex in X. The mutual-visibility number μ (G) …
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products
J Tian, S Klavžar - arXiv preprint arXiv:2212.07193, 2022 - arxiv.org
If $ G $ is a graph and $ X\subseteq V (G) $, then $ X $ is a total mutual-visibility set if every
pair of vertices $ x $ and $ y $ of $ G $ admits a shortest $ x, y $-path $ P $ with $ V (P)\cap …
pair of vertices $ x $ and $ y $ of $ G $ admits a shortest $ x, y $-path $ P $ with $ V (P)\cap …
General position sets in two families of Cartesian product graphs
For a given graph G, the general position problem asks for the largest set of vertices S⊆ V
(G), such that no three distinct vertices of S belong to a common shortest path of G. The …
(G), such that no three distinct vertices of S belong to a common shortest path of G. The …
On the general position problem on Kneser graphs
B Patkós - arXiv preprint arXiv:1903.08056, 2019 - arxiv.org
In a graph $ G $, a geodesic between two vertices $ x $ and $ y $ is a shortest path
connecting $ x $ to $ y $. A subset $ S $ of the vertices of $ G $ is in general position if no …
connecting $ x $ to $ y $. A subset $ S $ of the vertices of $ G $ is in general position if no …
Characterization of general position sets and its applications to cographs and bipartite graphs
A vertex subset S of a graph G is a general position set of G if no vertex of S lies on a
geodesic between two other vertices of S. The cardinality of a largest general position set of …
geodesic between two other vertices of S. The cardinality of a largest general position set of …