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

只看該作者 · 發(fā)表于 2025-4-1 04:06:50

, , ° , , °?, ,°?,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.

只看該作者 · 發(fā)表于 2025-4-1 09:54:51

-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.

只看該作者 · 發(fā)表于 2025-4-1 12:43:48

只看該作者 · 發(fā)表于 2025-4-1 15:32:45

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-10 03:47
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved