Zobrazeno 1 - 10
of 42
pro vyhledávání: '"ZEMIN JIN"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 3, p 953 (2024)
Externí odkaz:
https://doaj.org/article/dc6b5951a739467ebea3549310ececa8
Publikováno v:
Energies, Vol 16, Iss 13, p 5205 (2023)
The stability in the operation of insulated gate bipolar transistor (IGBT) modules plays a crucial role in wind power generation. It is essential to improve the thermal performance of the heat sink of IGBT modules in wind power converters and reduce
Externí odkaz:
https://doaj.org/article/479caf78b9b348b295392577bab49220
Autor:
YUEFANG SUN1,2 yuefangsun2013@163.com, ZEMIN JIN3 zeminjin@zjnu.cn
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 3, p759-770. 12p.
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 46
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0c7c74776dfbed5db8abe26a6979379
https://doi.org/10.1007/s40840-022-01433-7
https://doi.org/10.1007/s40840-022-01433-7
Autor:
Yuefang Sun, Zemin Jin
Publikováno v:
Discrete Mathematics. 346:113420
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::443601df0a3696e66bce7ce72b931a8a
https://doi.org/10.1016/j.disc.2023.113420
https://doi.org/10.1016/j.disc.2023.113420
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 409-425 (2021)
For a graph G = (V, E) and a set S ⊆ V of at least two vertices, an S-tree is a such subgraph T of G that is a tree with S ⊆ V (T). Two S-trees T1 and T2 are said to be internally disjoint if E(T1) ∩ E(T2) = ∅ and V (T1) ∩ V (T2) = S, and e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4dad310783dee52852c4e05b356433e
https://doaj.org/article/6ba6691ec13748a99c6f24d786d131db
https://doaj.org/article/6ba6691ec13748a99c6f24d786d131db
Publikováno v:
Graphs and Combinatorics. 37:1025-1044
An edge-colored graph is called rainbow if all its edges are colored distinct. The anti-Ramsey number of a graph family $${\mathcal {F}}$$ in the graph G, denoted by $$AR{(G,{\mathcal {F}})}$$ , is the maximum number of colors in an edge-coloring of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06fd6c8210d33ad2cbbe01f79f29d793
https://doi.org/10.1007/s00373-021-02302-z
https://doi.org/10.1007/s00373-021-02302-z
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2018, Vol. 38 Issue 4, p1023-1036. 14p. 3 Diagrams.
Publikováno v:
Taiwanese J. Math. 24, no. 4 (2020), 785-815
In 2011, Caro et al. introduced the monochromatic connection of graphs. An edge-coloring of a connected graph $G$ is called a monochromatically connecting (MC-coloring, for short) if there is a monochromatic path joining any two vertices. The monochr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::313a9ddfb884c9208511ba42197de7fc
https://doi.org/10.11650/tjm/200102
https://doi.org/10.11650/tjm/200102
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 4, Pp 1023-1036 (2018)
A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors. The rainbow total-connection number, denoted by rtc(G), of a graph G is the minimum number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1728d82f1782dd40b7f503e002493256
https://doaj.org/article/931a99d6f3ba41b19bbbefc43df23862
https://doaj.org/article/931a99d6f3ba41b19bbbefc43df23862