We introduce notions of soft rough m-polar fuzzy sets and m-polar fuzzy soft rough sets as novel hybrid models for soft computing, and investigate some of their fundamental properties. We discuss the relationship between m-polar fuzzy soft rough approximation operators and crisp soft rough approximation operators. We also present applications of m-polar fuzzy soft rough sets to decision-making.

A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect if this system is totally dual integral. It is an open problem whether t-perfection is equivalent to strong t-perfection. We prove the equivalence for the class of claw-free graphs.

We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs only rather simple O(mn)-time algorithms were known. We use a hierarchical sparsifi...

The design of analog circuits is a complex and repetitive process aimed at finding the best variant. It characterized by uncertainty multivariate approaches. designer has to make different choices satisfy predefined specification with required parameters. This paper proposes method for facilitating amplifiers based on m-polar fuzzy graphs theory deep learning. M-polar are used because their fle...

In this paper we introduce the concept of edge domination and total edge domination in intuitionistic fuzzy graphs. We determine the edge domination number and total edge domination number for several classes of intuitionistic fuzzy graphs and obtain bounds for them. We also obtain Nordhaus gaddum type results for the parameters.

A graph G is dot-critical if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. We show that the totally dot-critical graphs essentially include the much-studied domination vertex-critical and edge-critical graphs as special cases. We investigate these properties, and provide a characterization of dot...

In this paper d2 degree of a vertex and total d2 -degree of a vertex in an intuitionistic fuzzy graphs are defined. Also (2, (c1, c2))-regularity and totally (2, (c1, c2))-regularity of an intuitionistic fuzzy graphs are defined. A relation between (2, (c1, c2))-regularity and totally (2, (c1, c2))-regularity on intuitionistic fuzzy graph is studied. (2, (c1, c2))regularity on a path on four ve...