Abstract
A threshold graph (respectively domishold graph) is a graph for which the independent sets (respectively the dominating sets) can be characterized by the 0, 1-solutions of a linear Inequality (see [1] and [3]). We define here the graphs for which the maximal independent sets (respectively the minimal dominating sets) are characterized by the 0, 1-solutions of a linear equation. Such graphs are said to be equistable (respectively equldominating). We characterize (by their architectural structure and by forbidden induced subgraphs) threshold graphs and domishold graphs which are equistable or equidominating. A larger class of equistable graphs is also presented.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
