O Suil

620 total citations
37 papers, 388 citations indexed

About

O Suil is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, O Suil has authored 37 papers receiving a total of 388 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 28 papers in Geometry and Topology and 23 papers in Discrete Mathematics and Combinatorics. Recurrent topics in O Suil's work include Graph theory and applications (28 papers), Advanced Graph Theory Research (26 papers) and Limits and Structures in Graph Theory (15 papers). O Suil is often cited by papers focused on Graph theory and applications (28 papers), Advanced Graph Theory Research (26 papers) and Limits and Structures in Graph Theory (15 papers). O Suil collaborates with scholars based in United States, South Korea and China. O Suil's co-authors include Douglas B. West, Jaehoon Kim, Sebastian M. Cioabă, Yongtang Shi, Sung‐Yell Song, Sungeun Kim, Daniel W. Cranston, Jong Yoon Hyun, Donggyu Kim and Jingmei Zhang and has published in prestigious journals such as Applied Mathematics and Computation, Linear Algebra and its Applications and Discrete Applied Mathematics.

In The Last Decade

O Suil

35 papers receiving 370 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
O Suil United States	11	297	284	125	74	34	37	388
Dein Wong China	12	387 1.3×	416 1.5×	90 0.7×	37 0.5×	21 0.6×	59	482
Sergio Bermudo Spain	12	331 1.1×	247 0.9×	78 0.6×	72 1.0×	21 0.6×	47	593
Baoyindureng Wu China	13	425 1.4×	241 0.8×	85 0.7×	109 1.5×	46 1.4×	109	471
Hongliang Lu China	10	266 0.9×	213 0.8×	117 0.9×	43 0.6×	60 1.8×	49	323
Mingqing Zhai China	15	376 1.3×	490 1.7×	302 2.4×	20 0.3×	25 0.7×	53	531
Peter Che Bor Lam Hong Kong	14	370 1.2×	179 0.6×	90 0.7×	53 0.7×	118 3.5×	42	453
Fenglei Tian China	10	269 0.9×	290 1.0×	49 0.4×	23 0.3×	15 0.4×	41	318
Bijan Taerı Iran	11	210 0.7×	275 1.0×	146 1.2×	27 0.4×	75 2.2×	57	405
Lihua You China	13	414 1.4×	399 1.4×	68 0.5×	25 0.3×	76 2.2×	68	528
Baogen Xu China	10	272 0.9×	99 0.3×	29 0.2×	84 1.1×	19 0.6×	46	312

Countries citing papers authored by O Suil

Since Specialization

Citations

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

Fields of papers citing papers by O Suil

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of O Suil

This figure shows the co-authorship network connecting the top 25 collaborators of O Suil. A scholar is included among the top collaborators of O Suil 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 O Suil. O Suil is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Kim, Jaehoon, et al.. (2024). On the spectral radius of graphs with given maximum degree and girth. Linear Algebra and its Applications. 691. 182–195.

Kim, Donggyu & O Suil. (2022). Eigenvalues and parity factors in graphs with given minimum degree. Discrete Mathematics. 346(4). 113290–113290. 4 indexed citations

Kim, Jaehoon, et al.. (2021). A Cvetković-type Theorem for coloring of digraphs. Linear Algebra and its Applications. 634. 30–36. 3 indexed citations

Kim, Sungeun, et al.. (2020). An odd [1,b]-factor in regular graphs from eigenvalues. Discrete Mathematics. 343(8). 111906–111906. 17 indexed citations

Suil, O, et al.. (2019). Extremal problems on saturation for the family of k-edge-connected graphs. Discrete Applied Mathematics. 260. 278–283. 5 indexed citations

Suil, O & Yongtang Shi. (2018). Sharp bounds for the Randić index of graphs with given minimum and maximum degree. Discrete Applied Mathematics. 247. 111–115. 10 indexed citations

Mohar, Bojan, et al.. (2018). Interlacing families and the Hermitian spectral norm of digraphs. Linear Algebra and its Applications. 564. 201–208. 4 indexed citations

Suil, O, et al.. (2017). On the Wiener index, distance cospectrality and transmission-regular graphs. Discrete Applied Mathematics. 230. 1–10. 31 indexed citations

Suil, O. (2016). Spectral radius and fractional matchings in graphs. European Journal of Combinatorics. 55. 144–148. 24 indexed citations

10.

Kim, Jaehoon, et al.. (2016). On r-dynamic coloring of graphs. Discrete Applied Mathematics. 206. 65–72. 32 indexed citations

11.

Suil, O & Douglas B. West. (2015). Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs. Discrete Applied Mathematics. 190-191. 163–168. 2 indexed citations

12.

Behrend, Roger E., O Suil, & Douglas B. West. (2015). Sharp lower bounds on the fractional matching number. Discrete Applied Mathematics. 186. 272–274. 7 indexed citations

13.

Kim, Jaehoon, et al.. (2015). The difference and ratio of the fractional matching number and the matching number of graphs. Discrete Mathematics. 339(4). 1382–1386. 6 indexed citations

14.

Suil, O. (2014). Edge-connectivity in regular multigraphs from eigenvalues. Linear Algebra and its Applications. 491. 4–14. 8 indexed citations

15.

Kim, Jaehoon & O Suil. (2013). Average connectivity and average edge-connectivity in graphs. Discrete Mathematics. 313(20). 2232–2238. 8 indexed citations

16.

Cranston, Daniel W., et al.. (2013). Game matching number of graphs. Discrete Applied Mathematics. 161(13-14). 1828–1836. 10 indexed citations

17.

Suil, O, et al.. (2011). Longest cycles in k-connected graphs with given independence number. Journal of Combinatorial Theory Series B. 101(6). 480–485. 8 indexed citations

18.

Suil, O. (2011). Matchings, connectivity, and eigenvalues in regular graphs. Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign). 4 indexed citations

19.

Suil, O & Douglas B. West. (2010). Matching and edge-connectivity in regular graphs. European Journal of Combinatorics. 32(2). 324–329. 17 indexed citations

20.

Suil, O & Douglas B. West. (2009). Balloons, cut‐edges, matchings, and total domination in regular graphs of odd degree. Journal of Graph Theory. 64(2). 116–131. 33 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