Connected domination in graphs and \(v\)-numbers of binomial edge ideals
DOI10.1007/s13348-023-00412-wzbMATH Open1548.05342MaRDI QIDQ6617352
Lisa Seccia, Delio Jaramillo-Velez
Publication date: 10 October 2024
Published in: Collectanea Mathematica (Search for Journal in Brave)
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Combinatorial aspects of commutative algebra (05E40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regularity bounds for binomial edge ideals
- Associated primes of monomial ideals and odd holes in graphs
- Connected domination number of a graph and its complement
- The Castelnuovo-Mumford regularity of binomial edge ideals
- Binomial edge ideals and conditional independence statements
- Some inequalities about connected domination number
- On the ideal theory of graphs
- Approximation algorithms for connected dominating sets
- Binomial edge ideals of regularity 3
- Cohen-Macaulay graphs
- The \(v\)-number of edge ideals
- The \(\text{v} \)-number of monomial ideals
- A proof of a conjecture on the connected domination number
- A proof for a conjecture on the regularity of binomial edge ideals
- Generalized minimum distance functions and algebraic invariants of Geramita ideals
- Regularity of binomial edge ideals of certain block graphs
- Bounds on the connected domination number of a graph
- The \(v\)-number and Castelnuovo-Mumford regularity of graphs
- Binomial Edge Ideals of Complete Multipartite Graphs
- Algebraic properties of the binomial edge ideal of complete bipartite graph
- Graphs and Ideals Generated by Some 2-Minors
- Cayley-Bacharach Schemes and Their Canonical Modules
- Connected Domination and Spanning Trees with Many Leaves
- Footprint and minimum distance functions
- Binomial Ideals
- The Geometry of Syzygies
- Algebraic Properties of Edge Ideals of Some Vertex-Weighted Oriented Cyclic Graphs
- On the regularity of binomial edge ideals
- Monomial Algebras
- Hilbert Function of Binomial Edge Ideals
- Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs
- Bounds for the minimum distance function
Related Items (1)
This page was built for publication: Connected domination in graphs and \(v\)-numbers of binomial edge ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617352)
