Keyword

diameter 3

Description: A graph-theoretic property describing a graph whose greatest shortest-path distance between vertices is three edges.
OpenAlex ID: keywords/diameter-3
1960 · A. J. Hoffman, R. R. Singleton · IBM Journal of Research and Development · 632
1998 · T. D. Bending, D. Fon-Der-Flaass · The Electronic Journal of Combinatorics · 66
2010 · Jack H. Koolen, Jongyook Park · European Journal of Combinatorics · 62
2000 · Noga Alon, Andr�s Gy�rf�s, et al. · Journal of Graph Theory · 47
1996 · Willem H. Haemers · Linear Algebra and its Applications · 46
1995 · M. Fellows, P. Hell, et al. · Discrete Applied Mathematics · 46
2002 · Aleksandar Jurišić, Jack Koolen · Discrete Mathematics · 37
2014 · Alice Devillers, Wei Jin, et al. · Journal of Graph Theory · 33
2014 · A. A. Makhnëv, M. S. Nirova, et al. · SibFU Digital Repository (Siberian Federal University) · 32
2006 · Štefko Miklavič, Primož Potočnik · Journal of Combinatorial Theory Series B · 30
1984 · A.E Brouwer · Discrete Mathematics · 26
1980 · Clement W.H. Lam · Discrete Mathematics · 25
2015 · Yanhong Zhang, Yumei Hu · Applied Mathematics and Computation · 24
1988 · Abraham Berman, Anton Kotzig · Discrete Mathematics · 24
2017 · Fei Huang, Xueliang Li, et al. · Discrete Mathematics · 19
1977 · Frederick J Fuglister · Journal of Combinatorial Theory Series A · 19
2019 · Minjia Shi, Denis S. Krotov, et al. · Designs Codes and Cryptography · 18
1984 · K. R. Parthasarathy, N. Srinivasan · COMBINATORICA · 15
2020 · Hilal A. Ganie · Applied Mathematics and Computation · 13
2013 · Tomáš Vetrík · Graphs and Combinatorics · 13
2012 · Tomáš Vetrík · Discrete Mathematics · 13
2009 · M. R. Alfuraidan, J. I. Hall · The Michigan Mathematical Journal · 10
1998 · Александр Алексеевич Махнев · Дискретная математика · 10
2019 · E. V. Sotnikova · Sibirskie Elektronnye Matematicheskie Izvestiya · 9
Works count: 131
Citation count: 1,504
Year
Topic
Type