找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Mathematical Modelling and Scientific Computation; International Confer P. Balasubramaniam,R. Uthayakumar Conference proceedings 2012 Sprin

[复制链接]
楼主: LH941
发表于 2025-3-30 09:46:37 | 显示全部楼层
RETRACTED CHAPTER: On Faintly SP-, (Semi-Pre-,)-Continuous Functionsontinuous functions using the concept of b-. open sets and .-. open sets, the class of faintly sp-.-Continuous functions is a generalization of faintly Pre-. (Semi-.)-Continuous functions due to A.A. El-Atik [1]. At the same time, the class of faintly semi-pre-.-Continuous functions is a generalizat
发表于 2025-3-30 13:50:45 | 显示全部楼层
发表于 2025-3-30 18:52:17 | 显示全部楼层
RETRACTED CHAPTER: On ,-e-Irresolute Functions functions. The concepts of e-open sets were introduced by Erdal Ekici [1] and e-.-open sets were introduced by ÄOzkoc and GÄulhan Aslim [2]. Also we investigate relationships between strongly e-irresolute functions and graphs.
发表于 2025-3-30 23:42:36 | 显示全部楼层
On the Strictness of a Bound for the Diameter of Cayley Graphs Generated by Transposition Treesiency, among other properties. A problem of practical and theoretical interest is to determine or estimate the diameter of Cayley graphs. Let Γ be a Cayley graph on .! vertices generated by a transposition tree on vertex set {1,2,…,.}. In an oft-cited paper [1], it was shown that the diameter of Γ i
发表于 2025-3-31 03:08:40 | 显示全部楼层
发表于 2025-3-31 06:46:26 | 显示全部楼层
Global Vertex-Edge Domination Sets in Total Graph and Product Graph of Path Pn Cycle Cnd the new concept, Global vertex-edge dominating set, and identified the Global vertex–edge domination number of Total graph of ., ., ., and .. An attempt is made to identify the Global vertex-edge domination number of Cartesian product of path . and cycle ..
发表于 2025-3-31 10:16:15 | 显示全部楼层
Incomparability Graphs of Latticesinct vertices ., . ∈ .(.) are adjacent if and only if they are incomparable. In this paper, we study the incomparability graphs of lattices. We prove that, a disconnected graph is a graph of a lattice . if and only if . is of the form .. We prove that, Γ′(.) cannot be an n-gon for any . ≥ 5. Some pr
发表于 2025-3-31 14:33:36 | 显示全部楼层
发表于 2025-3-31 18:16:31 | 显示全部楼层
发表于 2025-3-31 22:29:25 | 显示全部楼层
Solving Bottleneck Bi-criteria Transportation Problems which provides more efficient solutions than other existing methods [1, 14, 15] and the best compromise solution to the problem. Numerical example has been provided to illustrate the solution procedure. The proposed technique provides the necessary decision support to the decision makers, while the
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 04:10
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表