Results 31 to 40 of about 157,845 (305)
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
Lefteris M. Kirousis +1 more
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
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.
Peter Frankl, Hiroshi Maehara
openaire +2 more sources
- 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
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
Tractabilities and Intractabilities on Geometric Intersection Graphs
Algorithms, 2013 A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection.
Ryuhei Uehara
doaj +1 more source
Mathematics, 2019 The independent number of a graph G is the cardinality of the maximum independent set of G, denoted by α ( G ) . The independent dominating number is the cardinality of the smallest independent set that dominates all vertices of G.
Mohammad Abudayah, Omar Alomari
doaj +1 more source
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
Foremost Walks and Paths in Interval Temporal Graphs
Algorithms, 2022 The min-wait foremost, min-hop foremost and min-cost foremost paths and walks problems in interval temporal graphs are considered. We prove that finding min-wait foremost and min-cost foremost walks and paths in interval temporal graphs is NP-hard.
Anuj Jain, Sartaj Sahni
doaj +1 more source