5 papers · 1 filter
One construction for the Miura-ori flip-graph degree sequence
Chakshu Gupta
The flip graph of an origami crease pattern has the locally flat-foldable mountain-valley assignments as vertices, and an edge joins two of them that differ by a single face flip.…
Domination versus edge domination in regular graphs of degree at least seven
Chakshu Gupta
Baste et al. (2020) conjectured that every regular graph of positive degree has domination number at most its edge domination number, the least size of a maximal matching. Combinin…
An annihilation-number Caro-Wei bound: a TxGraffiti conjecture and an independence-number bracket
Chakshu Gupta
Automated conjecturing programs scan collections of graphs for inequalities between invariants that no stored graph violates, then offer the survivors for proof or refutation. TxGr…
Height functions on the Miura-ori flip graph: degree sequence and diameter
Chakshu Gupta
The state space of an origami crease pattern forms a flip graph, whose vertices are the flat-foldable mountain-valley assignments and whose edges join assignments differing by a si…
Sharp bounds between the saturation number and the harmonic index
Chakshu Gupta
The saturation number of a graph is the minimum cardinality of a maximal matching, and is its harmonic index. TxGraffiti conjectured in 2023 that $μ^*(G) \le H(…