Results 31 to 40 of about 1,503,165 (299)
Maximal Neighborhood Search and Rigid Interval Graphs
Journal of Graph Algorithms and Applications, 2013 A rigid interval graph is an interval graph which has only one clique tree. In 2009, Panda and Das show that all connected unit interval graphs are rigid interval graphs.
Peng Li, Yaokun Wu
doaj +1 more source
Coloring problem of signed interval graphs [PDF]
Transactions on Combinatorics, 2019 A signed graph $(G,\sigma)$ is a graph together with an assignment of signs $\{+,-\}$ to its edges where $\sigma$ is the subset of its negative edges.
Farzaneh Ramezani
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
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
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
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 +3 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
3D-interval-filament graphs [PDF]
, 2007 Gavril [F. Gavril, Maximum weight independent sets and cliques in intersection graphs of filaments, Inform. Process. Lett. 73 (2000) 181–188] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs ...
Gavril, Fanica
core +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
On interval representations of graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Braga de Queiroz, Aquiles +2 more
openaire +2 more sources