Inverse Problems in Graph Theory: Nets
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2018/12/08
-
Indian UGC (journal)
-
Refrences7
-
Citations5
-
A. A. Makhnev
-
M. P. Golubyatnikov
-
Wenbin Guo
Cite
Makhnev, A. A., et al. “Inverse Problems in Graph Theory: Nets”. Communications in Mathematics and Statistics, vol. 7, no. 1, 2018, pp. 69-83, https://doi.org/10.1007/s40304-018-0159-4.
Makhnev, A. A., Golubyatnikov, M. P., & Guo, W. (2018). Inverse Problems in Graph Theory: Nets. Communications in Mathematics and Statistics, 7(1), 69-83. https://doi.org/10.1007/s40304-018-0159-4
Makhnev, A. A., M. P. Golubyatnikov, and Wenbin Guo. “Inverse Problems in Graph Theory: Nets”. Communications in Mathematics and Statistics 7, no. 1 (2018): 69-83. https://doi.org/10.1007/s40304-018-0159-4.
Makhnev AA, Golubyatnikov MP, Guo W. Inverse Problems in Graph Theory: Nets. Communications in Mathematics and Statistics. 2018;7(1):69-83.
Journal Category
Science
Mathematics
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Shilla distance-regular graphs | European Journal of Combinatorics |
| 33 | 2010 |
| 10.1134/S1064562410030282 | 2010 | |||
| A generalization of Moore graphs of diameter two | Journal of Combinatorial Theory, Series B |
| 19 | 1971 |
| Makhnev, A., Nirova, M.: On distance-regular Shilla graphs. Matem. Notes 103(4), 558–571 (2018) | 2018 | |||
| Zavarnitsine, A.V.: Finite simple groups with narrow prime spectrum. Siberian Electron. Math. Rep. 6, 1–12 (2009) | 2009 |
Refrences Analysis
Refrences used by this article by year
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Distance-Regular Graphs of Diameter 3 Without Triangles with $$c_2=2$$ | Communications in Mathematics and Statistics |
| 2022 | |
On small distance-regular graphs with the intersection arrays $\{mn-1,(m-1)(n+1)$, $n-m+1;1,1,(m-1)(n+1)\}$ | Diskretnaya Matematika | 2022 | ||
On distance-regular graphs withc2= 2 | Discrete Mathematics and Applications |
| 2021 | |
| Automorphisms of a Graph With Intersection Array {nm − 1, nm− n + m − 1, n − m + 1;1, 1, nm− n + m − 1} | Algebra and Logic |
| 2020 | |
On distance-regular graphs with $c_2=2$ | Diskretnaya Matematika | 1 | 2020 |
Citations Analysis
| Category | Category Repetition |
|---|---|
| Science: Mathematics | 2 |
| Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods | 1 |
The category
Science: Mathematics 2
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Automorphisms of a Graph With Intersection Array {nm − 1, nm− n + m − 1, n − m + 1;1, 1, nm− n + m − 1} and was published in 2020. The most recent citation comes from a 2022 study titled Distance-Regular Graphs of Diameter 3 Without Triangles with $$c_2=2$$. This article reached its peak citation in 2022, with 2 citations. It has been cited in 4 different journals. Among related journals, the Diskretnaya Matematika cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.