2 papers
math.CO2025
Oriented hypergraphs and generalizing the Harary-Sachs theorem to integer matrices
Blake Dvarishkis, Josephine Reynes, Lucas J. Rusnak
Incidence-based generalizations of cycle covers, called contributors, extend the Harary-Sachs coefficient theorem for characteristic polynomials of the adjacency matrix of graphs.…
cs.SI2025
GraphC: Parameter-free Hierarchical Clustering of Signed Graph Networks v2
Muhieddine Shebaro, Lucas Rusnak, Martin Burtscher +1
Spectral clustering methodologies, when extended to accommodate signed graphs, have encountered notable limitations in effectively encapsulating inherent grouping relationships. Re…