G.R. Omidi

715 total citations
38 papers, 469 citations indexed

About

G.R. Omidi is a scholar working on Geometry and Topology, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics. According to data from OpenAlex, G.R. Omidi has authored 38 papers receiving a total of 469 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Geometry and Topology, 23 papers in Computational Theory and Mathematics and 21 papers in Discrete Mathematics and Combinatorics. Recurrent topics in G.R. Omidi's work include Graph theory and applications (19 papers), Advanced Graph Theory Research (15 papers) and Finite Group Theory Research (13 papers). G.R. Omidi is often cited by papers focused on Graph theory and applications (19 papers), Advanced Graph Theory Research (15 papers) and Finite Group Theory Research (13 papers). G.R. Omidi collaborates with scholars based in Iran, Netherlands and China. G.R. Omidi's co-authors include B. Tayfeh‐Rezaie, Peter J‎. Cameron, Edwin van Dam, Willem H. Haemers, Hamid Reza Maimani, Mina Zarei, M. R. Pournaki, Reinhard Laue, Alfred Wassermann and Hong‐Jian Lai and has published in prestigious journals such as Linear Algebra and its Applications, Discrete Mathematics and Journal of Combinatorial Theory Series A.

In The Last Decade

G.R. Omidi

35 papers receiving 457 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
G.R. Omidi Iran	13	357	255	192	160	75	38	469
Bijan Taerı Iran	11	275 0.8×	210 0.8×	146 0.8×	127 0.8×	75 1.0×	57	405
Qiongxiang Huang China	14	473 1.3×	332 1.3×	199 1.0×	210 1.3×	70 0.9×	85	528
B. Tayfeh‐Rezaie Iran	13	278 0.8×	179 0.7×	193 1.0×	134 0.8×	237 3.2×	52	520
Vilmar Trevisan Brazil	15	542 1.5×	380 1.5×	112 0.6×	244 1.5×	29 0.4×	82	655
C. Dalfó Spain	10	264 0.7×	201 0.8×	124 0.6×	53 0.3×	91 1.2×	67	428
Sukanta Pati India	15	545 1.5×	438 1.7×	123 0.6×	181 1.1×	35 0.5×	43	619
Maryvonne Mahéo France	9	231 0.6×	356 1.4×	133 0.7×	105 0.7×	129 1.7×	14	479
Enide Andrade Portugal	9	305 0.9×	248 1.0×	82 0.4×	138 0.9×	31 0.4×	50	379
Axel Kohnert Germany	9	204 0.6×	121 0.5×	164 0.9×	95 0.6×	116 1.5×	24	418
Siemion Fajtlowicz United States	11	228 0.6×	313 1.2×	97 0.5×	117 0.7×	71 0.9×	24	476

Countries citing papers authored by G.R. Omidi

Since Specialization

Citations

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

Fields of papers citing papers by G.R. Omidi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of G.R. Omidi

This figure shows the co-authorship network connecting the top 25 collaborators of G.R. Omidi. A scholar is included among the top collaborators of G.R. Omidi 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 G.R. Omidi. G.R. Omidi 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

Omidi, G.R.. (2021). A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles. Combinatorics Probability Computing. 30(5). 654–669.

Omidi, G.R., et al.. (2017). Stars versus stripes Ramsey numbers. European Journal of Combinatorics. 67. 268–274. 2 indexed citations

Omidi, G.R., et al.. (2016). On group choosability of graphs, I.. Ars Combinatoria. 126. 195–209. 2 indexed citations

Omidi, G.R., et al.. (2013). Ramsey numbers of 3-uniform loose paths and loose cycles. Journal of Combinatorial Theory Series A. 121. 64–73. 9 indexed citations

Dam, Edwin van & G.R. Omidi. (2013). Strongly walk-regular graphs. Journal of Combinatorial Theory Series A. 120(4). 803–810. 7 indexed citations

Omidi, G.R., et al.. (2013). On the sum of signless Laplacian eigenvalues of a graph. Linear Algebra and its Applications. 438(11). 4539–4546. 21 indexed citations

Omidi, G.R., et al.. (2013). The Ramsey Number of Loose Paths in 3-Uniform Hypergraphs. The Electronic Journal of Combinatorics. 20(1). 11 indexed citations

Dam, Edwin van & G.R. Omidi. (2011). Graphs whose normalized Laplacian has three eigenvalues. Linear Algebra and its Applications. 435(10). 2560–2569. 21 indexed citations

Omidi, G.R., et al.. (2011). A note on the Ramsey number of stars — Complete graphs. European Journal of Combinatorics. 32(4). 598–599. 3 indexed citations

10.

Omidi, G.R., et al.. (2010). The spectral characterization of graphs of index less than 2 with no Z n as a component.. Ars Combinatoria. 94. 1 indexed citations

11.

Omidi, G.R.. (2009). On graphs with largest Laplacian eigenvalue at most 4.. Australas. J Comb.. 44. 163–170. 1 indexed citations

12.

Omidi, G.R., et al.. (2009). Graphs with three distinct eigenvalues and largest eigenvalue less than 8. Linear Algebra and its Applications. 430(8-9). 2053–2062. 13 indexed citations

13.

Omidi, G.R.. (2009). On Integral Graphs with Few Cycles. Graphs and Combinatorics. 25(6). 841–849. 7 indexed citations

14.

Omidi, G.R.. (2009). On a signless Laplacian spectral characterization of T-shape trees. Linear Algebra and its Applications. 431(9). 1607–1615. 36 indexed citations

15.

Omidi, G.R.. (2008). On a Laplacian spectral characterization of graphs of index less than 2. Linear Algebra and its Applications. 429(11-12). 2724–2731. 10 indexed citations

16.

Omidi, G.R.. (2007). The spectral characterization of graphs of index less than 2 with no path as a component. Linear Algebra and its Applications. 428(7). 1696–1705. 12 indexed citations

17.

Omidi, G.R., et al.. (2007). Starlike trees are determined by their Laplacian spectrum. Linear Algebra and its Applications. 422(2-3). 654–658. 69 indexed citations

18.

Cameron, Peter J‎., Hamid Reza Maimani, G.R. Omidi, & B. Tayfeh‐Rezaie. (2006). 3-Designs from PSL(2,q). Discrete Mathematics. 306(23). 3063–3073. 20 indexed citations

19.

Omidi, G.R., et al.. (2006). Spectral characterization of graphs with index at most 2+5. Linear Algebra and its Applications. 420(2-3). 483–489. 43 indexed citations

20.

Omidi, G.R., M. R. Pournaki, & B. Tayfeh‐Rezaie. (2006). 3-Designs with block size 6 from PSL(2,q) and their large sets. Discrete Mathematics. 307(13). 1580–1588. 6 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