We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let [Formula: see text] be unicyclic graph with unique odd cycle and its ideal. compute exact values all symbolic defects using describe one method to find quasi-polynomial associated ideal text]. classify class graphs when some power maximal annihilates any fixed Also those graphs, we Hilbert function module

A polynomial ideal I ⊆ R[x] is THk-exact if every linear polynomial that is non-negative over VR(I), the real variety of I , is a sum of squares of polynomials of degree at most k modulo I . Lovász recognized that a graph is perfect if and only if the vanishing ideal of the characteristic vectors of its stable sets is TH1-exact, and asked for a characterization of ideals which are TH1-exact. We...

This paper deals with some results concerning the notion of extended ideal based zero divisor graph $overline Gamma_I(R)$ for an ideal $I$ of a commutative ring $R$ and characterize its bipartite graph. Also, we study the properties of an annihilator of $overline Gamma_I(R)$.

In this paper, we study the nonlinear inverse problem of estimating spectrum a system matrix, that drives finite-dimensional affine dynamical system, from partial observations single trajectory data. noiseless case, prove an annihilating polynomial whose roots are subset spectrum, can be uniquely determined We then which eigenvalues matrix recovered and derive various sufficient necessary condi...

The concepts of a prime ideal of a distributively generated (d.g.) nearring R, a prime d.g. near-ring and an irreducible R-group are introduced1). The annihilating ideal of an irreducible R-group with an R-generator is a prime ideal. Consequently we define a prime ideal to be primitively prime if it is the annihilating ideal of such an R-group, and a d.g. near-ring to be a primitively prime nea...