Titlebook: Mathematical and Computational Intelligence to Socio-scientific Analytics and Applications; Pankaj Srivastava,M. Lellis Thivagar,Chai Chin

綠州

, , ° , , °?, ,°?,The Complexity of the rainbow connection number of a graph is NP-hard. In this paper we study the strong rainbow edge coloring of corona product of pencil graphs with path graph, complete graphs and cycle graphs. The result obtained are exact.

annexation

-Ideals Characterizations in Posets,We explore and prove some interesting .-ideal results in posets in this paper. The analogous conditions for an ideal to be a .-ideal of a poset . are obtained by characterizing prime ideals to be .-ideals. Finally, the .-ideal separation theorem is discussed.

獨裁政府

幻想