3 papers
math.CO2026
Almost complete graphs determined by Laplacian hook immanantal polynomials
Shuaijun Li, Guangfu Wang
Let \(\mathscr{G}_n\) be the family of simple graphs obtained from \(K_n\) by deleting at most five edges. For a fixed integer \(1\leq k\leq n\), let \(Φ_k(L(G),x)\) denote the im…
math.CO2026
Principal minors of effective-resistance matrices and local resistance radii
Guangfu Wang
Let be a finite connected weighted graph and let be its effective-resistance matrix. For every nonempty vertex set , we factor the cofactor sum and determinant of the pr…
math.CO2026
Root cubes and two-vertex deletions from daisy grids
Guangfu Wang
Daisy cubes are finite partial cubes that admit an isometric hypercube embedding whose labels form a Boolean down-set. Call a vertex a root if it can receive the all-zero label in…