EPIDEMIOLOGÍA

⦁ House, Thomas. (2011). Modelling Epidemics on Networks.

Contemporary Physics - CONTEMP PHYS. 53.
https://doi.org/10.1080/00107514.2011.644443
⦁ Asma Azizi, Cesar Montalvo, Baltazar Espinoza, Yun Kang, Carlos
Castillo-Chavez, Epidemics on networks: Reducing disease
transmission using health emergency declarations and peer
communication, Infectious Disease Modelling, Volume 5, 2020,
Pages 12-22, ISSN 2468-0427,
https://doi.org/10.1016/j.idm.2019.11.002
⦁ Anna L. Ziff, Robert M. Ziff. Fractal kinetics of COVID-19
pandemic. https://doi.org/10.1101/2020.02.16.20023820
⦁ Mushlin, R. & Kershenbaum, A. & Gallagher, S. & Rebbeck,
Timothy. (2007). A graph-theoretical approach for pattern
discovery in epidemiological research. IBM Systems Journal. 46.
135 - 149. https://doi.org/10.1147/sj.461.0135
⦁ Jessica Enright, Rowland Raymond Kao, Epidemics on dynamic
networks, (REVIEW) Epidemics 4, 2018, 88-97,
https://doi.org/10.1016/j.epidem.2018.04.003

COMUNIDADES Y MODULARIDAD
⦁ M. E. J. Newman, Modularity and community structure in
networks. PNAS vol. 103 no. 23 8577-8582 (2006)
https://doi.org/10.1073/pnas.0601602103
⦁ Robert J. Mokken. Cliques, clubs and clans. Quality and Quantity,
13 161-173. (1979) https://doi.org/10.1007/BF00139635
⦁ Tien-Dzung Tran and Yung-Keun Kwon, The relationship between
modularity and robustness in signalling networks J. R. Soc.
Interface 2013 10, 20130771, published 18 September 2013
https://doi.org/10.1098/rsif.2013.0771
⦁ Zheng Gao, Zaixin Lu, Weidong Chen , Jiaofei Zhong and Yuanjun
Bi. The Maximum Community Partition Problem in Networks
2013 ICSIT. https://doi.org/10.1109/SOCIETY.2013.10
⦁ L. Freeman. A set of Measures of Centrality Based on
Betweenness. Sociometry 40 (1): 35--41 (March 1977)
https://doi.org/10.2307/3033543

CENTRALIDAD

1
 ⦁ Noh H. Rieger. Random walks on complex networks Phys. Rev.
Lett. 92(11) 2004 https://doi.org/10.1103/PhysRevLett.92.118701
⦁ Stephenson, K. and Zelen, M.. Rethinking centrality: Methods and
examples. Social Networks 11(1) 1-37 (1989)
https://doi.org/10.1016/0378-8733(89)90016-6

ASORTATIVIDAD
⦁ M. E. J. Newman. Assortative mixing in networks. Phys. Rev. Lett.
89, 208701. (2002)
https://doi.org/10.1103/PhysRevLett.89.208701
⦁ Rogier Noldus, Piet Van Mieghem. Assortativity in complex
networks. Journal of Complex Networks, Volume 3, Issue 4,
December 2015, Pages 507–542,
https://doi.org/10.1093/comnet/cnv005

DOMINACIÓN
⦁ Laura Kelleher and Margaret Cozzens. Dominant sets in social
network graphs. Mathematical Social Sciences, 16 267-279 (1988)
https://doi.org/10.1016/0165-4896(88)90041-8
⦁ Vasek Chvátal, William J. Cook. The discipline number of a graph.
Annals of Discrete Mathematics, 48 191-198. (1991)
https://doi.org/10.1016/S0167-5060(08)71049-5

COLOREADO
⦁ Cornelius Croitoru, Henri Luchian, Ovidiu Gheorghie, and Adriana
Apetrei. A New Genetic Graph Coloring Heuristic.
https://es.scribd.com/document/50146984/evo-coloring-cc-hl-og-
aa-2002
⦁ Graph Coloring on a Coarse Grained Multiprocessor (extended
abstract) Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous ,
Jens Gustedt , and Jan Arne Telle https://eecs.wsu.edu/
~assefaw/publications/coloring-cgm-wg00.pdf
⦁ R. Fabila-Monroy, D. Flores-Peñaloza, et al. On the Chromatic
Numbers of Some Flip Graphs. 23rd EWCG, pp.110-113 March
12-16, Graz, Austria, 2007. https://dmtcs.episciences.org/460/pdf
⦁ Mohammad Malkawi, Mohammad Al-Haj Hassan, and Osama Al-
Haj Hassan. A New Exam Scheduling Algorithm Using Graph
Coloring. https://iajit.org/portal/PDF/vol.5,no.1/11-68.pdf
⦁ Yachun Liu, Jin Xu, Linqiang Pan, et al. DNA Solution of a Graph
2
 Coloring Problem. J. Chem. Inf. Comput. Sci. 42(3), 524-528 (2002)
https://doi.org/10.1021/ci010016o
⦁ Gary Chartrand, Garry L. Johns, Kathleen A. McKeon and Ping
Zhang. Rainbow connection in graphs. Mathematica Bohemica.
133(1), 85-98 (2008) http://doi.org/10.21136/MB.2008.133947
⦁ Gary Chartrand, Ping Zhang. The Ascending Ramsey Index of a
Graph. Symmetry 15(2):523 (2023)
http://doi.org/10.3390/sym15020523
⦁ S.M. Hegde. Set colorings of graphs. European Journal of
Combinatorics 30(4), 986-995 (2009)
http://doi.org/10.1016/j.ejc.2008.06.005

NÚMERO DE HUB
⦁ M. Walsh, The hub number of a graph. Intl. J. Mathematics and
Computer Science 1 (2006), 117–124. https://future-in-tech.net/R-
Walsh.pdf
⦁ Tracy Grauman, Stephen G. Hartke, Adam Jobson, Bill Kinnersley,
Douglas B. West, Lesley Wiglesworth, Pratik Worah, Hehui Wu,
The hub number of a graph, Information Processing Letters,
Volume 108, Issue 4 (2008), 226-228,
https://doi.org/10.1016/j.ipl.2008.05.022

MUNDO PEQUEÑO
⦁ Babak Farzad, Mike Molloy, Bruce Reed. (Δ-k)-critical graphs.
Journal of Combinatorial Theory, Series B, Volume 93, Issue 2,
Pages 117-328 (March 2005)
https://doi.org/10.1016/j.jctb.2004.09.006
⦁ A New Dense Group Graph Discovered by an Evolutionary
Approach. O. Wohlmuth. Paralleles und Verteiltes Rechnen
Beitraege zum 4. Workshop ueber Wissenschaftlichen Rechnen, p.
21-27, Shaker Verlag 1996. ISBN 3-8265-1826-8.
⦁ Mirka Miller and Jozef Siran. Moore graphs and beyond: A survey
of the degree/diameter problem. Electron. J. Combin. DS14
(December 5, 2005) 61 pp. https://doi.org/10.37236/35 (Son 61
páginas. Puede dividirse entre dos grupos)

3
REDES
⦁ Kaltenbrunner A., Aragón P., Laniado D., Volkovich Y. Not All Paths
Lead to Rome: Analysing the Network of Sister Cities. In:
Elmenreich W., Dressler F., Loreto V. (eds) Self-Organizing
Systems. IWSOS 2013. Lecture Notes in Computer Science, vol
8221. Springer, Berlin, Heidelberg. (2014)
https://doi.org/10.1007/978-3-642-54140-7_14
⦁ A. Oehmichen, K. Hua, J. Amador Díaz López, M. Molina-Solana, J.
Gómez-Romero and Y. Guo, "Not All Lies Are Equal. A Study Into
the Engineering of Political Misinformation in the 2016 US
Presidential Election," in IEEE Access, vol. 7, pp. 126305-126314,
2019. https://doi.org/10.1109/ACCESS.2019.2938389
(Matemáticas para detectar fake news en twitter)
⦁ Silvia Donker. Networking data. A network analysis of Spotify's
socio-technical related artist network April 2019
https://www.researchgate.net/publication/333202172
⦁ Marc Benkert, Joachim Gudmundsson, Herman Haverkort and
Alexander Wolff. Constructing minimum-interference networks.
Computational Geometry: Theory and Applications. Volume 40 ,
Issue 3 (2008) Pages 179-194.
https://doi.org/10.1016/j.comgeo.2007.06.004
⦁ E. Chavez, S. Dobrev, E. Kranakis, et al. Route discovery with
constant memory in oriented planar geometric networks.
Networks 48 (1) (2006) 7-15. https://doi.org/10.1002/net.20114
⦁ J. Urrutia. Local Solutions for Global Problems in Wireless
Networks. Journal of Discrete Algorithms 5 (2007) 395-407.
https://www.matem.unam.mx/
~urrutia/online_papers/LocalGlobal.pdf
⦁ M. A. Garrido, C. Iturriaga, A. Márquez, J. R. Portillo, P. Reyes and
A. Wolff. Labeling Subway Lines. ISAAC (2001) 649-659.
https://doi.org/10.1007/3-540-45678-3_55
⦁ M. A. Garrido, A. Márquez, A. Morgana and J. R. Portillo. Single
Bend Wiring on Surfaces. Discrete Applied Mathematics 117 (1-3)
(2002) 27-40. https://doi.org/10.1016/S0166-218X(01)00177-9
⦁ Raghavan, Cohoon and Sahni. Single bend wiring. Journal of
Algorithms 7, 232-257. 1986
https://doi.org/10.1016/0196-6774(86)90006-4

4
VARIOS
⦁ A. Colorni, M.Dorigo and V. Maniezzo. Distributed Optimization
by Ant Colonies. Proceedings of the First European Conference on
Artificial Life, Paris, France. Elsevier Publishing, 134-142 (1992)
http://faculty.washington.edu/paymana/swarm/colorni92-
ecal.pdf
⦁ Katsuhisa Yamanaka and Shin-ichi Nakano. Listing all plane
graphs. WALCOM: Algorithms and Computation. WALCOM 2008.
Lecture Notes in Computer Science, vol 4921. Springer, Berlin,
Heidelberg. https://doi.org/10.1007/978-3-540-77891-2_20
⦁ Louis Caccetta, Roland Häggkvist. On diameter critical graphs.
Discrete Mathematics 28(3), 223-229 (1979)
https://doi.org/10.1016/0012-365X(79)90129-8