This map shows the geographic impact of Wensong Lin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Wensong Lin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Wensong Lin more than expected).
This network shows the impact of papers produced by Wensong Lin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Wensong Lin. The network helps show where Wensong Lin may publish in the future.
Co-authorship network of co-authors of Wensong Lin
This figure shows the co-authorship network connecting the top 25 collaborators of Wensong Lin.
A scholar is included among the top collaborators of Wensong Lin based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Wensong Lin. Wensong Lin is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Lin, Wensong, et al.. (2017). On (s, t)-relaxed L(2, 1)-labelings of the hexagonal lattice.. Ars Combinatoria. 130. 319–331.
Lin, Wensong, et al.. (2010). Circular L(j, k)-labeling Numbers of Trees and Products of Graphs. Journal of Southeast University. 26(1). 142–145.5 indexed citations
10.
Lin, Wensong, et al.. (2009). Real Edge Spans of Distance two Labelings of Graphs. Journal of Southeast University. 25(4). 557–562.2 indexed citations
Lin, Wensong, et al.. (2007). L(s, t) Edge Spans of Trees and Product of Two Paths. Journal of Southeast University. 23(4). 639–642.2 indexed citations
Lin, Wensong, et al.. (2004). Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval.. Ars Combinatoria. 70.7 indexed citations
19.
Lin, Wensong & Guohua Gu. (2004). A Necessary and Sufficient Condition for a vertex-transitive Graph to be Star Extremal. Journal of Southeast University. 20(3). 374–377.1 indexed citations
20.
Lin, Wensong, et al.. (2001). Neighborhood Union Condition with Distance for Vertex-pancyclicity.. Ars Combinatoria. 61.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.