找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復制鏈接]
樓主: LH941
51#
發(fā)表于 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
52#
發(fā)表于 2025-3-30 13:50:45 | 只看該作者
53#
發(fā)表于 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.
54#
發(fā)表于 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
55#
發(fā)表于 2025-3-31 03:08:40 | 只看該作者
56#
發(fā)表于 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 ..
57#
發(fā)表于 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
58#
發(fā)表于 2025-3-31 14:33:36 | 只看該作者
59#
發(fā)表于 2025-3-31 18:16:31 | 只看該作者
60#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-25 06:48
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
清涧县| 贵阳市| 商洛市| 大新县| 隆林| 鹤岗市| 丰台区| 拉孜县| 商丘市| 阿拉善盟| 白朗县| 沈丘县| 封丘县| 增城市| 平度市| 威远县| 福贡县| 修水县| 称多县| 昭苏县| 长泰县| 新竹县| 无为县| 合肥市| 绍兴市| 洪湖市| 苍梧县| 浠水县| 横山县| 福贡县| 阳泉市| 文登市| 和田县| 瓮安县| 平潭县| 四子王旗| 康保县| 中山市| 临清市| 马边| 黄冈市|