Dingjun Lou

410 total citations
56 papers, 245 citations indexed

About

Dingjun Lou is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Geometry and Topology. According to data from OpenAlex, Dingjun Lou has authored 56 papers receiving a total of 245 indexed citations (citations by other indexed papers that have themselves been cited), including 51 papers in Computational Theory and Mathematics, 33 papers in Computer Networks and Communications and 15 papers in Geometry and Topology. Recurrent topics in Dingjun Lou's work include Advanced Graph Theory Research (49 papers), Interconnection Networks and Systems (30 papers) and Graph theory and applications (14 papers). Dingjun Lou is often cited by papers focused on Advanced Graph Theory Research (49 papers), Interconnection Networks and Systems (30 papers) and Graph theory and applications (14 papers). Dingjun Lou collaborates with scholars based in China, New Zealand and Japan. Dingjun Lou's co-authors include Derek Holton, Qinglin Yu, Michael D. Plummer, R. E. L. Aldred, Wei Wang, Akira Saito, Yueping Li, Hikoe Enomoto, Ning Zhong and Katsuhiro Ota and has published in prestigious journals such as IEEE Access, Applied Mathematics and Computation and Discrete Applied Mathematics.

In The Last Decade

Dingjun Lou

50 papers receiving 230 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Dingjun Lou China 9 223 132 113 73 25 56 245
Evelyne Flandrin France 12 374 1.7× 122 0.9× 147 1.3× 172 2.4× 61 2.4× 41 416
Yubao Guo Germany 10 260 1.2× 149 1.1× 65 0.6× 85 1.2× 148 5.9× 52 326
Liming Xiong China 12 441 2.0× 190 1.4× 303 2.7× 120 1.6× 56 2.2× 118 507
John Mitchem United States 11 270 1.2× 58 0.4× 69 0.6× 90 1.2× 58 2.3× 29 318
Simon Špacapan Slovenia 11 271 1.2× 147 1.1× 128 1.1× 72 1.0× 79 3.2× 33 350
Célia Picinin de Mello Brazil 10 231 1.0× 35 0.3× 51 0.5× 86 1.2× 49 2.0× 30 248
Min Chih Lin Argentina 12 266 1.2× 90 0.7× 75 0.7× 54 0.7× 41 1.6× 32 304
Dan Pritikin United States 8 168 0.8× 79 0.6× 78 0.7× 106 1.5× 73 2.9× 24 263
Keith Edwards United Kingdom 10 295 1.3× 32 0.2× 38 0.3× 103 1.4× 86 3.4× 29 307
Arthur M. Hobbs United States 9 193 0.9× 65 0.5× 93 0.8× 65 0.9× 50 2.0× 26 242

Countries citing papers authored by Dingjun Lou

Since Specialization
Citations

This map shows the geographic impact of Dingjun Lou'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 Dingjun Lou with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dingjun Lou more than expected).

Fields of papers citing papers by Dingjun Lou

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dingjun Lou. 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 Dingjun Lou. The network helps show where Dingjun Lou may publish in the future.

Co-authorship network of co-authors of Dingjun Lou

This figure shows the co-authorship network connecting the top 25 collaborators of Dingjun Lou. A scholar is included among the top collaborators of Dingjun Lou 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 Dingjun Lou. Dingjun Lou 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.
Lou, Dingjun, et al.. (2019). Characterization of k-subconnected graphs. Applied Mathematics and Computation. 364. 124620–124620. 1 indexed citations
2.
Lou, Dingjun, et al.. (2017). Panconnectedness of K-trees with Sufficiently Large Toughness.. Ars Combinatoria. 130. 181–196. 1 indexed citations
3.
Lou, Dingjun, et al.. (2014). An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs.. Ars Combinatoria. 115. 315–333. 5 indexed citations
4.
Li, Yueping, et al.. (2008). Algorithms For The Optimal Hamiltonian Path In Halin Graphs.. Ars Combinatoria. 87(6). 3053–63. 2 indexed citations
5.
Lou, Dingjun, et al.. (2008). Notes on factor-critically, extendability and independence number.. Ars Combinatoria. 87. 1 indexed citations
6.
Li, Yueping & Dingjun Lou. (2007). A New Algorithm for Determinating 1-extendable Graphs: Design and Implementation.. International MultiConference of Engineers and Computer Scientists. 2327–2332. 1 indexed citations
7.
Li, Yueping & Dingjun Lou. (2007). Matching Extendability Augmentation in Bipartite Graphs.. International MultiConference of Engineers and Computer Scientists. 109(5). 2291–2296. 1 indexed citations
8.
Lou, Dingjun, et al.. (2007). Path decomposition of defect 1-extendable bipartite graphs.. Australas. J Comb.. 39. 175–182. 1 indexed citations
9.
Lou, Dingjun. (2007). Characterizing minimally n-extendable bipartite graphs. Discrete Mathematics. 308(11). 2269–2272. 1 indexed citations
10.
Lou, Dingjun & Wei Wang. (2005). An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs.. Ars Combinatoria. 77. 9 indexed citations
11.
Lou, Dingjun & Qinglin Yu. (2004). Sufficient conditions for n-matchable graphs.. Australas. J Comb.. 29. 127–134. 6 indexed citations
12.
Lou, Dingjun, et al.. (2004). A note on max-leaves spanning tree problem in Halin graphs.. Australas. J Comb.. 29. 95–98. 1 indexed citations
13.
Lou, Dingjun, et al.. (2004). Characterizing factor critical graphs and an algorithm.. Australas. J Comb.. 30. 51–56. 3 indexed citations
14.
Lou, Dingjun, et al.. (2004). Graphs with no M-alternating path between two vertices. Discrete Mathematics. 280(1-3). 237–240. 1 indexed citations
15.
Lou, Dingjun, et al.. (2003). To Determine 1-Extendable Graphs and its Algorithm.. Ars Combinatoria. 69. 1 indexed citations
16.
Chen, Guantao, Hikoe Enomoto, Ken Kawarabayashi, et al.. (2001). Vertex-disjoint cycles containing specified edges in a bipartite graph. The Australasian Journal of Combinatorics. 23. 37–48. 6 indexed citations
17.
Lou, Dingjun. (2000). On matchability of graphs.. Australas. J Comb.. 21. 201–210. 6 indexed citations
18.
Lou, Dingjun. (1996). A local neighbourhood condition for n-extendable graphs.. Australas. J Comb.. 14. 229–234. 1 indexed citations
19.
Holton, Derek, et al.. (1995). n-extendability of line graphs, power graphs, and total graphs.. Australas. J Comb.. 11. 215–222. 2 indexed citations
20.
Lou, Dingjun. (1994). Some conditions for n-extendable graphs.. Australas. J Comb.. 9. 123–136. 9 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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Evelyne Flandrin Breakdown of academic impact, for papers by Yubao Guo Breakdown of academic impact, for papers by Liming Xiong Breakdown of academic impact, for papers by John Mitchem Breakdown of academic impact, for papers by Simon Špacapan Breakdown of academic impact, for papers by Célia Picinin de Mello Breakdown of academic impact, for papers by Min Chih Lin Breakdown of academic impact, for papers by Dan Pritikin Breakdown of academic impact, for papers by Keith Edwards Breakdown of academic impact, for papers by Arthur M. Hobbs
Rankless by CCL
2026