A graph [Formula: see text] is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function defined on vertices. Then text]well-covered weight. For every text], set functions such text]-well-covered vector space, denoted as WCW(G). Deciding whether an input co-NP-complete. Therefore, finding WCW(G) co-NP-hard. generating subgraph induced complete b...

In this article we continue to develop the theory of generating symmetries for integrable equations. A technique computation using Maple is presented. The based on standard symmetry method. By it find KdV, Camassa–Holm, mKdV, sine-Gordon, Boussinesq, associated Degasperis-Procesi and Novikov