On the Spectra of Underlying Complete Split Multigraphs
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.
Authors
- John T. Saccoman (ORCID: https://orcid.org/0000-0002-9622-5145)
- Michael Catli
- Joseph Kajon
Institutions
- Seton Hall University (US)
Publication Details
- Journal
- International Journal of Computational and Applied Mathematics & Computer Science
- Published
- 2025-08-04
- DOI
- https://doi.org/10.37394/232028.2025.5.5
- Citations
- 1
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 1.50