Simplex graph (English Wikipedia)

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

refsWebsite

Global rank English rank

2^nd place

11^th place

8^th place

69^th place

59^th place

207^th place

136^th place

451^st place

277^th place

ams.org

Imrich, Klavžar & Mulder (1999) credit the introduction of simplex graphs to a later paper, also by Bandelt and van de Vel, but this appears to be a mistake. Imrich, Wilfried; Klavžar, Sandi; Mulder, Henry Martyn (1999), "Median graphs and triangle-free graphs", SIAM Journal on Discrete Mathematics, 12 (1): 111–118, CiteSeerX 10.1.1.28.5906, doi:10.1137/S0895480197323494, MR 1666073.

Propp (1997). Propp, James (1997), "Generating random elements of finite distributive lattices", Electronic Journal of Combinatorics, 4 (2): R15, arXiv:math.CO/9801066, doi:10.37236/1330, S2CID 13313188.

Barthélemy, Leclerc & Monjardet (1986), page 200. Barthélemy, J.-P.; Leclerc, B.; Monjardet, B. (1986), "On the use of ordered sets in problems of comparison and consensus of classifications", Journal of Classification, 3 (2): 187–224, doi:10.1007/BF01894188, S2CID 6092438.
Propp (1997). Propp, James (1997), "Generating random elements of finite distributive lattices", Electronic Journal of Combinatorics, 4 (2): R15, arXiv:math.CO/9801066, doi:10.37236/1330, S2CID 13313188.
Imrich, Klavžar & Mulder (1999) credit the introduction of simplex graphs to a later paper, also by Bandelt and van de Vel, but this appears to be a mistake. Imrich, Wilfried; Klavžar, Sandi; Mulder, Henry Martyn (1999), "Median graphs and triangle-free graphs", SIAM Journal on Discrete Mathematics, 12 (1): 111–118, CiteSeerX 10.1.1.28.5906, doi:10.1137/S0895480197323494, MR 1666073.

Imrich, Klavžar & Mulder (1999) credit the introduction of simplex graphs to a later paper, also by Bandelt and van de Vel, but this appears to be a mistake. Imrich, Wilfried; Klavžar, Sandi; Mulder, Henry Martyn (1999), "Median graphs and triangle-free graphs", SIAM Journal on Discrete Mathematics, 12 (1): 111–118, CiteSeerX 10.1.1.28.5906, doi:10.1137/S0895480197323494, MR 1666073.

Barthélemy, Leclerc & Monjardet (1986), page 200. Barthélemy, J.-P.; Leclerc, B.; Monjardet, B. (1986), "On the use of ordered sets in problems of comparison and consensus of classifications", Journal of Classification, 3 (2): 187–224, doi:10.1007/BF01894188, S2CID 6092438.
Propp (1997). Propp, James (1997), "Generating random elements of finite distributive lattices", Electronic Journal of Combinatorics, 4 (2): R15, arXiv:math.CO/9801066, doi:10.37236/1330, S2CID 13313188.