Optimization problem for star covers of graphs without four cycles
Abstract
This work presents a study of star covers on graphs. Unlike traditional formulations that minimize the number of stars, our aim is to optimize the number of bipartite components used in the cover. This problem, motivated by a symmetric nonnegative trifactorization of matrices and the SNT-rank of graphs, is in general hard to solve. We consider a family of graphs that do not contain four cycles, and develop an algorithm to determine the SNT-rank of such graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.