\begin{thebibliography}{10}

\bibitem{j_hale_compliance_nodate}
{J. Hale}, P.~Hawrylak, and M.~Papa, ``Compliance {Method} for a
  {Cyber}-{Physical} {System}.''
\newblock U.S. Patent Number 9,471,789, Oct. 18, 2016.

\bibitem{baloyi_guidelines_2019}
N.~Baloyi and P.~Kotzé, ``Guidelines for {Data} {Privacy} {Compliance}: {A}
  {Focus} on {Cyberphysical} {Systems} and {Internet} of {Things},'' in {\em
  {SAICSIT} '19: {Proceedings} of the {South} {African} {Institute} of
  {Computer} {Scientists} and {Information} {Technologists} 2019}, (Skukuza
  South Africa), Association for Computing Machinery, 2019.

\bibitem{allman_complying_2006}
E.~Allman, ``Complying with {Compliance}: {Blowing} it off is not an option.,''
  {\em ACM Queue}, vol.~4, no.~7, 2006.

\bibitem{newman2010networks}
M.~Newman, {\em Networks: An Introduction}.
\newblock Oxford University Press, 2010.

\bibitem{Mieghem2018DirectedGA}
P.~V. Mieghem, ``Directed graphs and mysterious complex eigenvalues,'' 2018.

\bibitem{ZENITANI2023103081}
K.~Zenitani, ``Attack graph analysis: An explanatory guide,'' {\em Computers \&
  Security}, vol.~126, p.~103081, 2023.

\bibitem{Zeng2019SurveyOA}
J.~Zeng, S.~Wu, Y.~Chen, R.~Zeng, and C.~Wu, ``Survey of attack graph analysis
  methods from the perspective of data and knowledge processing,'' {\em Secur.
  Commun. Networks}, vol.~2019, pp.~2031063:1--2031063:16, 2019.

\bibitem{ming_diss}
M.~Li, P.~Hawrylak, and J.~Hale, {\em A System for Attack Graph Generation and
  Analysis}.
\newblock {PhD} dissertation, The University of Tulsa, Tulsa, OK, 2021.

\bibitem{10.1145/3491257}
M.~Li, P.~Hawrylak, and J.~Hale, ``Strategies for practical hybrid attack graph
  generation and analysis,'' {\em Digital Threats}, oct 2021.

\bibitem{Guo2017HermitianAM}
K.~Guo and B.~Mohar, ``Hermitian adjacency matrix of digraphs and mixed
  graphs,'' {\em Journal of Graph Theory}, vol.~85, 2017.

\bibitem{Brualdi2010SpectraOD}
R.~A. Brualdi, ``Spectra of digraphs,'' {\em Linear Algebra and its
  Applications}, vol.~432, pp.~2181--2213, 2010.

\bibitem{noauthor_health_1996}
``Health {Insurance} {Portability} and {Accountability} {Act} of 1996.''
\newblock Pub. L. No. 104-191. 1996 [Online]. Available:
  https://www.govinfo.gov/content/pkg/PLAW-104publ191/html/PLAW-104publ191.htm.

\bibitem{PCI}
P.~S.~S. Council, ``Payment {Card} {Industry} {(PCI)} {Data} {Security}
  {Standard},'' May 2018.
\newblock {Available:
  https://www.pcisecuritystandards.org/documents/PCI$\_$DSS$\_$v3-2-1.pdf}.

\bibitem{PMID:30064421}
M.~Ashtiani, A.~Salehzadeh-Yazdi, Z.~Razaghi-Moghadam, H.~Hennig,
  O.~Wolkenhauer, M.~Mirzaie, and M.~Jafari, ``A systematic survey of
  centrality measures for protein-protein interaction networks,'' {\em BMC
  systems biology}, vol.~12, p.~80, July 2018.

\bibitem{Katz}
L.~Katz, ``{A new status index derived from sociometric analysis},'' {\em
  Psychometrika}, vol.~18, pp.~39--43, March 1953.

\bibitem{ModKatz}
M.~Ogura and V.~M. Preciado, ``Katz centrality of markovian temporal networks:
  Analysis and optimization,'' {\em 2017 American Control Conference (ACC)},
  pp.~5001--5006, 2017.

\bibitem{K_Path_Edge}
P.~D. Meo, E.~Ferrara, G.~Fiumara, and A.~Ricciardello, ``A novel measure of
  edge centrality in social networks,'' {\em Knowledge-Based Systems}, vol.~30,
  pp.~136--150, jun 2012.

\bibitem{PageRank}
S.~Brin and L.~Page, ``The anatomy of a large-scale hypertextual web search
  engine,'' {\em Computer Networks and ISDN Systems}, vol.~30, no.~1,
  pp.~107--117, 1998.
\newblock Proceedings of the Seventh International World Wide Web Conference.

\bibitem{Adapted_PageRank}
T.~Agryzkov, J.~L. Oliver, L.~Tortosa, and J.-F. Vicent, ``An algorithm for
  ranking the nodes of an urban network based on the concept of pagerank
  vector,'' {\em Appl. Math. Comput.}, vol.~219, pp.~2186--2193, 2012.

\bibitem{li_combining_2019}
M.~Li, P.~Hawrylak, and J.~Hale, ``Combining {OpenCL} and {MPI} to support
  heterogeneous computing on a cluster,'' {\em ACM International Conference
  Proceeding Series}, 2019.

\bibitem{zeng_cyber_2017}
K.~Zeng, ``Cyber {Attack} {Analysis} {Based} on {Markov} {Process} {Model},''
  Master's thesis, The University of Tulsa, Tulsa, OK, 2017.

\bibitem{dominance}
R.~T. Prosser, ``Applications of boolean matrices to the analysis of flow
  diagrams,'' in {\em Papers Presented at the December 1-3, 1959, Eastern Joint
  IRE-AIEE-ACM Computer Conference}, IRE-AIEE-ACM '59 (Eastern), (New York, NY,
  USA), p.~133–138, Association for Computing Machinery, 1959.

\bibitem{LI2018512}
C.~Li, L.~Wang, S.~Sun, and C.~Xia, ``Identification of influential spreaders
  based on classified neighbors in real-world complex networks,'' {\em Applied
  Mathematics and Computation}, vol.~320, pp.~512--523, 2018.

\bibitem{MO2019121538}
H.~Mo and Y.~Deng, ``Identifying node importance based on evidence theory in
  complex networks,'' {\em Physica A: Statistical Mechanics and its
  Applications}, vol.~529, p.~121538, 2019.

\bibitem{sym11020284}
T.~Agryzkov, M.~Curado, F.~Pedroche, L.~Tortosa, and J.~F. Vicent, ``Extending
  the adapted pagerank algorithm centrality to multiplex networks with data
  using the pagerank two-layer approach,'' {\em Symmetry}, vol.~11, no.~2,
  2019.

\bibitem{10.1093/bioinformatics/bty965}
S.~Parvandeh and B.~A. McKinney, ``{EpistasisRank and EpistasisKatz:
  interaction network centrality methods that integrate prior knowledge
  networks},'' {\em Bioinformatics}, vol.~35, pp.~2329--2331, 11 2018.

\end{thebibliography}