The paper deals with the distributed minimum sharing problem: a set of decision-makers compute some local quantities interest in and decentralized way by exchanging information through communication network. We propose an adjustable approximate solution which enjoys several properties crucial importance applications. In particular, proposed has good decentralization it is scalable that number v...

There has been a great interest in three Higgs doublet models (3HDM) symmetric under an exact A4 symmetry. We provide the complete analytic necessary and sufficient conditions for point to be global minimum along neutral directions such models, discussing many of subtleties involved. also present number numerical examples, highlight those issues. then turn which break electric charge, presentin...

A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...