Connected Soft Graph

被引：27
|
作者：
Thenge, Jyoti D. [1 ]
Reddy, B. Surendranath [2 ]
Jain, Rupali S. [2 ]
机构：
[1] Punyashlok Ahilyadevi Holkar Solapur Univ, Sch Computat Sci, Solapur, Maharashtra, India
[2] Swami Ramanand Teerth Marathwada Univ, Sch Math Sci, Nanded, Maharashtra, India
来源：
NEW MATHEMATICS AND NATURAL COMPUTATION | 2020年 / 16卷 / 02期
关键词：
Soft set; soft graph; SETS;
D O I：
10.1142/S1793005720500180
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The theory of soft set offers a mathematical tool to deal with uncertainty. Nowadays, work on soft graph theory is progressing rapidly. In this paper, we define connected soft graph and derive some results. We also define cut vertex and bridge of soft graph along with some results on it.
引用
收藏
页码：305 / 318
页数：14
相关论文
共 50 条
  • [1] Connected Treewidth and connected graph searching
    Fraigniaud, P
    Nisse, N
    LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 479 - 490
  • [2] EVERY CONNECTED GRAPH IS A QUERY GRAPH
    WINKLER, PM
    JOURNAL OF GRAPH THEORY, 1987, 11 (02) : 231 - 234
  • [3] Soft weakly connected sets and soft weakly connected components
    Al-Ghour, Samer
    Al-Saadi, Hanan
    AIMS MATHEMATICS, 2024, 9 (01): : 1562 - 1575
  • [4] Connected graph game
    Csirmaz, L
    STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2002, 39 (1-2) : 129 - 136
  • [5] Connected graph searching
    Barriere, Lali
    Flocchini, Paola
    Fomin, Fedor V.
    Fraigniaud, Pierre
    Nisse, Nicolas
    Santoro, Nicola
    Thilikos, Dimitrios M.
    INFORMATION AND COMPUTATION, 2012, 219 : 1 - 16
  • [6] On the minimum augmentation of an l-connected graph to a k-connected graph
    Ishii, T
    Nagamochi, H
    ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 286 - 299
  • [7] How to contract an essentially 6-connected graph to a 5-connected graph
    Kriesell, Matthias
    DISCRETE MATHEMATICS, 2007, 307 (3-5) : 494 - 510
  • [8] The upper connected outer connected monophonic number of a graph
    Ganesamoorthy, K.
    Priya, S. Lakshmi
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2023, 8 (01) : 57 - 66
  • [9] A NONSEPARABLY CONNECTED METRIC SPACE AS A DENSE CONNECTED GRAPH
    Morayne, Michal
    Wojcik, Michal Ryszard
    HOUSTON JOURNAL OF MATHEMATICS, 2010, 36 (04): : 1227 - 1232
  • [10] EVERY CONNECTED, LOCALLY CONNECTED GRAPH IS UPPER EMBEDDABLE
    NEBESKY, L
    JOURNAL OF GRAPH THEORY, 1981, 5 (02) : 205 - 207
12345