Abstract: Complete split graphs are threshold graphs that have all nodes in the indepedent set adjacent to
all nodes in the clique. In 2002, Hansen et. al. presented criteria for complete split graphs that have integral
spectra for their adjacency matrix. We explore spectra of multigraphs that are underlying complete split for
some of the matrices associated with graphs. This is joint work with various undergraduate mathematics
majors at Seton Hall University.
Michael Catli, Joseph Kajon, John T. Saccoman, "On the Spectra of Underlying Complete Split Multigraphs," International Journal of Computational and Applied Mathematics & Computer Science, vol. 5, pp. 46-50, 2025, DOI:10.37394/232028.2025.5.5
Michael Catli, Joseph Kajon, John T. Saccoman. On the Spectra of Underlying Complete Split Multigraphs.
International Journal of Computational and Applied Mathematics & Computer Science. 2025;5:46-50. 10.37394/232028.2025.5.5