Universal vertex (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Universal vertex" in English language version.

refsWebsite

Global rank English rank

10doi.org

2^nd place

7ams.org

451^st place

277^th place

2books.google.com

3^rd place

2arxiv.org

69^th place

59^th place

1jstor.org

26^th place

20^th place

1renyi.hu

low place

1oeis.org

742^nd place

538^th place

1semanticscholar.org

11^th place

8^th place

ams.org

mathscinet.ams.org

Larrión, F.; de Mello, C. P.; Morgana, A.; Neumann-Lara, V.; Pizaña, M. A. (2004), "The clique operator on cographs and serial graphs", Discrete Mathematics, 282 (1–3): 183–191, doi:10.1016/j.disc.2003.10.023, MR 2059518.
Bonato, Anthony (2008), A course on the web graph, Graduate Studies in Mathematics, vol. 89, Atlantic Association for Research in the Mathematical Sciences (AARMS), Halifax, NS, p. 7, doi:10.1090/gsm/089, ISBN 978-0-8218-4467-0, MR 2389013.
Wolk, E. S. (1962), "The comparability graph of a tree", Proceedings of the American Mathematical Society, 13 (5): 789–795, doi:10.2307/2034179, JSTOR 2034179, MR 0172273.
Klee, Victor (1964), "On the number of vertices of a convex polytope", Canadian Journal of Mathematics, 16: 701–720, doi:10.4153/CJM-1964-067-6, MR 0166682
Bonato, Anthony; Kemkes, Graeme; Prałat, Paweł (2012), "Almost all cop-win graphs contain a universal vertex", Discrete Mathematics, 312 (10): 1652–1657, doi:10.1016/j.disc.2012.02.018, MR 2901161.
Haynes, Teresa W.; Hedetniemi, Stephen T.; Henning, Michael A. (2023), Domination in Graphs: Core Concepts, Springer Monographs in Mathematics, Springer, Cham, p. 2, doi:10.1007/978-3-031-09496-5, ISBN 978-3-031-09495-8, MR 4607811
Fisher, David C. (1994), "Domination, fractional domination, 2-packing, and graph products", SIAM Journal on Discrete Mathematics, 7 (3): 493–498, doi:10.1137/S0895480191217806, MR 1285586

arxiv.org

Lovász, László; Young, Neal E. (2002), "Lecture Notes on Evasiveness of Graph Properties", arXiv:cs/0205031
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. (2021), "Parameterized complexity of elimination distance to first-order logic properties", 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, IEEE, pp. 1–13, arXiv:2104.02998, doi:10.1109/LICS52264.2021.9470540, ISBN 978-1-6654-4895-6, S2CID 233169117

books.google.com

Bonato, Anthony (2008), A course on the web graph, Graduate Studies in Mathematics, vol. 89, Atlantic Association for Research in the Mathematical Sciences (AARMS), Halifax, NS, p. 7, doi:10.1090/gsm/089, ISBN 978-0-8218-4467-0, MR 2389013.
Pisanski, Tomaž; Servatius, Brigitte (2013), Configuration from a Graphical Viewpoint, Springer, p. 21, doi:10.1007/978-0-8176-8364-1, ISBN 978-0-8176-8363-4

doi.org

Larrión, F.; de Mello, C. P.; Morgana, A.; Neumann-Lara, V.; Pizaña, M. A. (2004), "The clique operator on cographs and serial graphs", Discrete Mathematics, 282 (1–3): 183–191, doi:10.1016/j.disc.2003.10.023, MR 2059518.
Bonato, Anthony (2008), A course on the web graph, Graduate Studies in Mathematics, vol. 89, Atlantic Association for Research in the Mathematical Sciences (AARMS), Halifax, NS, p. 7, doi:10.1090/gsm/089, ISBN 978-0-8218-4467-0, MR 2389013.
Wolk, E. S. (1962), "The comparability graph of a tree", Proceedings of the American Mathematical Society, 13 (5): 789–795, doi:10.2307/2034179, JSTOR 2034179, MR 0172273.
Pisanski, Tomaž; Servatius, Brigitte (2013), Configuration from a Graphical Viewpoint, Springer, p. 21, doi:10.1007/978-0-8176-8364-1, ISBN 978-0-8176-8363-4
Klee, Victor (1964), "On the number of vertices of a convex polytope", Canadian Journal of Mathematics, 16: 701–720, doi:10.4153/CJM-1964-067-6, MR 0166682
Chvátal, Václav; Kotzig, Anton; Rosenberg, Ivo G.; Davies, Roy O. (1976), "There are $\scriptstyle 2^{\aleph _{\alpha }}$ friendship graphs of cardinal $\scriptstyle \aleph _{\alpha }$ ", Canadian Mathematical Bulletin, 19 (4): 431–433, doi:10.4153/cmb-1976-064-1.
Bonato, Anthony; Kemkes, Graeme; Prałat, Paweł (2012), "Almost all cop-win graphs contain a universal vertex", Discrete Mathematics, 312 (10): 1652–1657, doi:10.1016/j.disc.2012.02.018, MR 2901161.
Haynes, Teresa W.; Hedetniemi, Stephen T.; Henning, Michael A. (2023), Domination in Graphs: Core Concepts, Springer Monographs in Mathematics, Springer, Cham, p. 2, doi:10.1007/978-3-031-09496-5, ISBN 978-3-031-09495-8, MR 4607811
Fisher, David C. (1994), "Domination, fractional domination, 2-packing, and graph products", SIAM Journal on Discrete Mathematics, 7 (3): 493–498, doi:10.1137/S0895480191217806, MR 1285586
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. (2021), "Parameterized complexity of elimination distance to first-order logic properties", 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, IEEE, pp. 1–13, arXiv:2104.02998, doi:10.1109/LICS52264.2021.9470540, ISBN 978-1-6654-4895-6, S2CID 233169117

jstor.org

Wolk, E. S. (1962), "The comparability graph of a tree", Proceedings of the American Mathematical Society, 13 (5): 789–795, doi:10.2307/2034179, JSTOR 2034179, MR 0172273.

oeis.org

Sloane, N. J. A. (ed.), "Sequence A327367 (Number of labeled simple graphs with n vertices, at least one of which is isolated)", The On-Line Encyclopedia of Integer Sequences, OEIS Foundation

renyi.hu

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

api.semanticscholar.org

Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. (2021), "Parameterized complexity of elimination distance to first-order logic properties", 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, IEEE, pp. 1–13, arXiv:2104.02998, doi:10.1109/LICS52264.2021.9470540, ISBN 978-1-6654-4895-6, S2CID 233169117