Locally linear graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Locally linear graph" in English language version.

refsWebsite

Global rank English rank

17ams.org

451^st place

277^th place

13doi.org

2^nd place

3arxiv.org

69^th place

59^th place

2handle.net

102^nd place

76^th place

1uam.mx

low place

1renyi.hu

low place

1qub.ac.uk

8,565^th place

5,337^th place

1semanticscholar.org

11^th place

8^th place

1tue.nl

9,054^th place

6,363^rd place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Fronček, Dalibor (1989), "Locally linear graphs", Mathematica Slovaca, 39 (1): 3–6, hdl:10338.dmlcz/136481, MR 1016323
Larrión, F.; Pizaña, M. A.; Villarroel-Flores, R. (2011), "Small locally $nK 2$ graphs" (PDF), Ars Combinatoria, 102: 385–391, MR 2867738
Farley, Arthur M.; Proskurowski, Andrzej (1982), "Networks immune to isolated line failures", Networks, 12 (4): 393–403, doi:10.1002/net.3230120404, MR 0686540; see in particular p. 397: "We call the resultant network a triangle cactus; it is a cactus network in which every line belongs to exactly one triangle."
Zelinka, Bohdan (1988), "Polytopic locally linear graphs", Mathematica Slovaca, 38 (2): 99–103, hdl:10338.dmlcz/133017, MR 0945363
Devillers, Alice; Jin, Wei; Li, Cai Heng; Praeger, Cheryl E. (2013), "Local 2-geodesic transitivity and clique graphs", Journal of Combinatorial Theory, Series A, 120 (2): 500–508, doi:10.1016/j.jcta.2012.10.004, MR 2995054. In the notation of this reference, the family of $2r$ -regular graphs is denoted as $F(r,2)$ .
Munaro, Andrea (2017), "On line graphs of subcubic triangle-free graphs", Discrete Mathematics, 340 (6): 1210–1226, doi:10.1016/j.disc.2017.01.006, MR 3624607
Fan, Cong (1996), "On generalized cages", Journal of Graph Theory, 23 (1): 21–31, doi:10.1002/(SICI)1097-0118(199609)23:1<21::AID-JGT2>3.0.CO;2-M, MR 1402135
Ruzsa, I. Z.; Szemerédi, E. (1978), "Triple systems with no six points carrying three triangles", Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, Colloq. Math. Soc. János Bolyai, vol. 18, Amsterdam and New York: North-Holland, pp. 939–945, MR 0519318
Lazebnik, Felix; Verstraëte, Jacques (2003), "On hypergraphs of girth five", Electronic Journal of Combinatorics, 10 R25: R25:1–R25:15, doi:10.37236/1718, MR 2014512
Makhnëv, A. A. (1988), "Strongly regular graphs with $\lambda =1$ ", Akademiya Nauk SSSR, 44 (5): 667–672, 702, doi:10.1007/BF01158426, MR 0980587, S2CID 120911900
Brouwer, A. E.; Haemers, W. H. (1992), "Structure and uniqueness of the (81,20,1,6) strongly regular graph", A collection of contributions in honour of Jack van Lint, Discrete Mathematics, 106/107: 77–82, doi:10.1016/0012-365X(92)90532-K, MR 1181899
Berlekamp, E. R.; van Lint, J. H.; Seidel, J. J. (1973), "A strongly regular graph derived from the perfect ternary Golay code", A Survey of Combinatorial Theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971), Amsterdam: North-Holland: 25–30, doi:10.1016/B978-0-7204-2262-7.50008-9, ISBN 9780720422627, MR 0364015{{citation}}: CS1 maint: work parameter with ISBN (link)
Cossidente, Antonio; Penttila, Tim (2005), "Hemisystems on the Hermitian surface", Journal of the London Mathematical Society, Second Series, 72 (3): 731–741, doi:10.1112/S0024610705006964, MR 2190334
Bondarenko, Andriy V.; Radchenko, Danylo V. (2013), "On a family of strongly regular graphs with $\lambda =1$ ", Journal of Combinatorial Theory, Series B, 103 (4): 521–531, arXiv:1201.0383, doi:10.1016/j.jctb.2013.05.005, MR 3071380
Hiraki, Akira; Nomura, Kazumasa; Suzuki, Hiroshi (2000), "Distance-regular graphs of valency 6 and $a_{1}=1$ ", Journal of Algebraic Combinatorics, 11 (2): 101–134, doi:10.1023/A:1008776031839, MR 1761910
McKay, Brendan D.; Megill, Norman D.; Pavičić, Mladen (2000), "Algorithms for Greechie diagrams", International Journal of Theoretical Physics, 39 (10): 2381–2406, arXiv:quant-ph/0009039, doi:10.1023/A:1026476701774, MR 1803695
Henning, Michael A.; Yeo, Anders (2020), "Chapter 12: Partial Steiner triple systems", Transversals in Linear Uniform Hypergraphs, Developments in Mathematics, vol. 63, Cham: Springer, pp. 171–177, doi:10.1007/978-3-030-46559-9_12, ISBN 978-3-030-46559-9, MR 4180641

arxiv.org (Global: 69^th place; English: 59^th place)

Bondarenko, Andriy V.; Radchenko, Danylo V. (2013), "On a family of strongly regular graphs with $\lambda =1$ ", Journal of Combinatorial Theory, Series B, 103 (4): 521–531, arXiv:1201.0383, doi:10.1016/j.jctb.2013.05.005, MR 3071380
Zehavi, Sa'ar; Oliveira, Ivo Fagundes David (2017), Not Conway's 99-graph problem, arXiv:1707.08047
McKay, Brendan D.; Megill, Norman D.; Pavičić, Mladen (2000), "Algorithms for Greechie diagrams", International Journal of Theoretical Physics, 39 (10): 2381–2406, arXiv:quant-ph/0009039, doi:10.1023/A:1026476701774, MR 1803695

doi.org (Global: 2^nd place; English: 2^nd place)

Farley, Arthur M.; Proskurowski, Andrzej (1982), "Networks immune to isolated line failures", Networks, 12 (4): 393–403, doi:10.1002/net.3230120404, MR 0686540; see in particular p. 397: "We call the resultant network a triangle cactus; it is a cactus network in which every line belongs to exactly one triangle."
Devillers, Alice; Jin, Wei; Li, Cai Heng; Praeger, Cheryl E. (2013), "Local 2-geodesic transitivity and clique graphs", Journal of Combinatorial Theory, Series A, 120 (2): 500–508, doi:10.1016/j.jcta.2012.10.004, MR 2995054. In the notation of this reference, the family of $2r$ -regular graphs is denoted as $F(r,2)$ .
Munaro, Andrea (2017), "On line graphs of subcubic triangle-free graphs", Discrete Mathematics, 340 (6): 1210–1226, doi:10.1016/j.disc.2017.01.006, MR 3624607
Fan, Cong (1996), "On generalized cages", Journal of Graph Theory, 23 (1): 21–31, doi:10.1002/(SICI)1097-0118(199609)23:1<21::AID-JGT2>3.0.CO;2-M, MR 1402135
Lazebnik, Felix; Verstraëte, Jacques (2003), "On hypergraphs of girth five", Electronic Journal of Combinatorics, 10 R25: R25:1–R25:15, doi:10.37236/1718, MR 2014512
Makhnëv, A. A. (1988), "Strongly regular graphs with $\lambda =1$ ", Akademiya Nauk SSSR, 44 (5): 667–672, 702, doi:10.1007/BF01158426, MR 0980587, S2CID 120911900
Brouwer, A. E.; Haemers, W. H. (1992), "Structure and uniqueness of the (81,20,1,6) strongly regular graph", A collection of contributions in honour of Jack van Lint, Discrete Mathematics, 106/107: 77–82, doi:10.1016/0012-365X(92)90532-K, MR 1181899
Berlekamp, E. R.; van Lint, J. H.; Seidel, J. J. (1973), "A strongly regular graph derived from the perfect ternary Golay code", A Survey of Combinatorial Theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971), Amsterdam: North-Holland: 25–30, doi:10.1016/B978-0-7204-2262-7.50008-9, ISBN 9780720422627, MR 0364015{{citation}}: CS1 maint: work parameter with ISBN (link)
Cossidente, Antonio; Penttila, Tim (2005), "Hemisystems on the Hermitian surface", Journal of the London Mathematical Society, Second Series, 72 (3): 731–741, doi:10.1112/S0024610705006964, MR 2190334
Bondarenko, Andriy V.; Radchenko, Danylo V. (2013), "On a family of strongly regular graphs with $\lambda =1$ ", Journal of Combinatorial Theory, Series B, 103 (4): 521–531, arXiv:1201.0383, doi:10.1016/j.jctb.2013.05.005, MR 3071380
Hiraki, Akira; Nomura, Kazumasa; Suzuki, Hiroshi (2000), "Distance-regular graphs of valency 6 and $a_{1}=1$ ", Journal of Algebraic Combinatorics, 11 (2): 101–134, doi:10.1023/A:1008776031839, MR 1761910
McKay, Brendan D.; Megill, Norman D.; Pavičić, Mladen (2000), "Algorithms for Greechie diagrams", International Journal of Theoretical Physics, 39 (10): 2381–2406, arXiv:quant-ph/0009039, doi:10.1023/A:1026476701774, MR 1803695
Henning, Michael A.; Yeo, Anders (2020), "Chapter 12: Partial Steiner triple systems", Transversals in Linear Uniform Hypergraphs, Developments in Mathematics, vol. 63, Cham: Springer, pp. 171–177, doi:10.1007/978-3-030-46559-9_12, ISBN 978-3-030-46559-9, MR 4180641

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Fronček, Dalibor (1989), "Locally linear graphs", Mathematica Slovaca, 39 (1): 3–6, hdl:10338.dmlcz/136481, MR 1016323
Zelinka, Bohdan (1988), "Polytopic locally linear graphs", Mathematica Slovaca, 38 (2): 99–103, hdl:10338.dmlcz/133017, MR 0945363

qub.ac.uk (Global: 8,565^th place; English: 5,337^th place)

pure.qub.ac.uk

Munaro, Andrea (2017), "On line graphs of subcubic triangle-free graphs", Discrete Mathematics, 340 (6): 1210–1226, doi:10.1016/j.disc.2017.01.006, MR 3624607

renyi.hu (Global: low place; English: low place)

Erdős, Paul; Rényi, Alfréd; Sós, Vera T. (1966), "On a problem of graph theory" (PDF), Studia Sci. Math. Hungar., 1: 215–235

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Makhnëv, A. A. (1988), "Strongly regular graphs with $\lambda =1$ ", Akademiya Nauk SSSR, 44 (5): 667–672, 702, doi:10.1007/BF01158426, MR 0980587, S2CID 120911900

tue.nl (Global: 9,054^th place; English: 6,363^rd place)

research.tue.nl

Berlekamp, E. R.; van Lint, J. H.; Seidel, J. J. (1973), "A strongly regular graph derived from the perfect ternary Golay code", A Survey of Combinatorial Theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971), Amsterdam: North-Holland: 25–30, doi:10.1016/B978-0-7204-2262-7.50008-9, ISBN 9780720422627, MR 0364015{{citation}}: CS1 maint: work parameter with ISBN (link)

uam.mx (Global: low place; English: low place)

xamanek.izt.uam.mx

Larrión, F.; Pizaña, M. A.; Villarroel-Flores, R. (2011), "Small locally $nK 2$ graphs" (PDF), Ars Combinatoria, 102: 385–391, MR 2867738

Locally linear graph (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)