If each minimal dominating set in a graph is minimum set, then the called well-dominated. Since seminal paper on well-dominated graphs appeared 1988, structure of from several restricted classes has been studied. In this we give complete characterization nontrivial direct products that are We prove if strong product well-dominated, both its factors When one graph, other factor being also suffic...

A vertex-cut S is called a super if G − disconnected and it contains no isolated vertices. The super-connectivity , κ ′, the minimum cardinality over all vertex-cuts. This article provides bounds for connectivity of direct product an arbitrary graph complete K n . Among other results, we show that non-complete with girth( ) = 3 ′( ∞, then × ≤ min{ mn 6, m ( 1) + 5, 5 8}, where | V )|

‎let $g_{i} $ be a subgroup of $ s_{m_{i}}‎ ,‎ 1 leq i leq k$‎. ‎suppose $chi_{i}$ is an irreducible complex character of $g_{i}$‎. ‎we consider $ g_{1}times cdots times g_{k} $ as subgroup of $ s_{m} $‎, ‎where $ m=m_{1}+cdots‎ +‎m_{k} $‎. ‎in this paper‎, ‎we give a formula for the dimension of $h_{d}(g_{1}times cdots times g_{k}‎, ‎chi_{1}timescdots times chi_{k})$ and investigate the existe...