Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Weigen Yan"'
Publikováno v:
Informatics in Education, Vol 22, Iss 1, Pp 1-19 (2023)
Source code plagiarism is a common occurrence in undergraduate computer science education. Many source code plagiarism detection tools have been proposed to address this problem. However, most of these tools only measure the similarity between assign
Externí odkaz:
https://doaj.org/article/c783319f4f834cd696cc856390957423
Publikováno v:
Journal of Graph Theory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7062bae083d55f38d7ab3354a8b653ae
https://doi.org/10.1002/jgt.22954
https://doi.org/10.1002/jgt.22954
Publikováno v:
Journal of Algebraic Combinatorics. 56:773-783
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaa20ef99f27cb0c0195a70706e51131
https://doi.org/10.1007/s10801-022-01131-4
https://doi.org/10.1007/s10801-022-01131-4
Autor:
Danyi Li, Weigen Yan
Publikováno v:
Applied Mathematics and Computation. 456:128125
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e72e2a56208f1f49e43f1cdae4efb205
https://doi.org/10.1016/j.amc.2023.128125
https://doi.org/10.1016/j.amc.2023.128125
Publikováno v:
Polycyclic Aromatic Compounds. 43:957-965
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c33ecda7f2dbfd5b5ef5f84b5c6d4bac
https://doi.org/10.1080/10406638.2021.2021428
https://doi.org/10.1080/10406638.2021.2021428
Publikováno v:
Linear and Multilinear Algebra. 70:7484-7492
Let D be a connected weighted digraph. The relation between the vertex- weighted complexity (with a fixed root) of the line digraph of D and the edge-weighted complexity (with a fixed root) of D ha...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9623681bd4e46d7151801ca25c16b04
https://doi.org/10.1080/03081087.2021.1994911
https://doi.org/10.1080/03081087.2021.1994911
Autor:
Yulan Chen, Weigen Yan
Publikováno v:
Discrete Applied Mathematics. 300:19-24
The Kirchhoff index K ( G ) of a graph G is one of the most important topological indices in mathematical chemistry. Suppose that G is a unicyclic graph with n vertices and the cycle in G is denoted by C k , where k is the length of this cycle. Let S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b8e4968fa55965ea83586ec060b4e50
https://doi.org/10.1016/j.dam.2021.05.007
https://doi.org/10.1016/j.dam.2021.05.007
Publikováno v:
Discrete Mathematics. 346:113427
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25d0358ece52f3e92fa8ff02e4e0c807
https://doi.org/10.1016/j.disc.2023.113427
https://doi.org/10.1016/j.disc.2023.113427
Publikováno v:
Informatics in Education.
Source code plagiarism is a common occurrence in undergraduate computer science education. Many source code plagiarism detection tools have been proposed to address this problem. However, most of these tools only measure the similarity between assign
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::553ae54dcb2372e35e8e47a9493d8396
https://doi.org/10.15388/infedu.2023.05
https://doi.org/10.15388/infedu.2023.05
Publikováno v:
Informatics in Education; Mar2023, Vol. 22 Issue 1, p1-19, 19p