Results 21 to 30 of about 147,371 (263)
Certain Types of Interval-Valued Fuzzy Graphs
Journal of Applied Mathematics, 2013 We propose certain types of interval-valued fuzzy graphs including balanced interval-valued fuzzy graphs, neighbourly irregular interval-valued fuzzy graphs, neighbourly total irregular interval-valued fuzzy graphs, highly irregular interval-valued fuzzy
Muhammad Akram +2 more
doaj +1 more source
Open-interval graphs versus closed-interval graphs
Discrete Mathematics, 1987 It is proved that a countable graph is a closed-interval graph if and only if it is an open-interval graph. A counter-example is given for uncountable graphs. Also the case of unit length intervals is studied.
Frankl, P., Maehara, H.
openaire +2 more sources
Strong Interval – Valued Pythagorean Fuzzy Soft Graphs
Ratio Mathematica, 2023 A Strong interval – valued Pythagorean fuzzy soft sets (SIVPFSS) an extending the theory of Interval-valued Pythagorean fuzzy soft set (IVPFSS). Then we Propose Strong interval valued Pythagorean fuzzy soft graphs (SIVPFSGs).
Mohammed Jabarulla Mohamed +1 more
doaj +1 more source
- and -labeling problems on interval graphs
AKCE International Journal of Graphs and Combinatorics, 2017 For a given graph , the - and -labeling problems assign the labels to the vertices of . Let be the set of non-negative integers. An - and -labeling of a graph is a function such that , for respectively, where represents the distance (minimum number of ...
Sk Amanathulla, Madhumangal Pal
doaj +1 more source
Theoretical Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Naoto Miyoshi +3 more
openaire +1 more source
Discussiones Mathematicae Graph Theory, 2016 We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks).
Alcón Liliana
doaj +1 more source
Discrete Mathematics, 1985 The interval thickness of a graph G is the minimum clique number of all the interval supergraphs of G. The clique number of a graph is the number of nodes of its biggest complete subgraph. On the other hand, the node- search number is the least number of searchers (pebbles) required to clear the ''contaminated'' edges of a graph. A contaminated edge is
Kirousis, Lefteris M. +1 more
openaire +2 more sources
Reconstruction of interval graphs
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kiyomi, Masashi +2 more
openaire +2 more sources
Blockchain Single and Interval Valued Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2019 Blockchain Technology (BCT) is a growing and reliable technology in various fields such as developing business deals, economic environments, social and politics as well. Without having a trusted central party this technology, gives the guarantee for safe
D. Nagarajan +3 more
doaj +1 more source
Recognizing edge clique graphs among interval graphs and probe interval graphs
Applied Mathematics Letters, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kong, Jing, Wu, Yaokun
openaire +1 more source