Results 21 to 30 of about 3,565,508 (299)
Algorithms for optimal min hop and foremost paths in interval temporal graphs
Applied Network Science, 2022 Path problems are fundamental to the study of graphs. Temporal graphs are graphs in which the edges connecting the vertices change with time. Min hop paths problem in a temporal graph is the problem of finding time respecting paths from source vertex to ...
Anuj Jain, Sartaj K. Sahni
doaj +1 more source
The Phylogeny Graphs of Doubly Partial Orders
Discussiones Mathematicae Graph Theory, 2013 The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced
Park Boram, Sano Yoshio
doaj +1 more source
On the Cubicity of Interval Graphs
Graphs and Combinatorics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chandran, L Sunil +2 more
openaire +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
A Characterization of 2-Tree Probe Interval Graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs ...
Brown David E. +2 more
doaj +1 more source
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
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
The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs
Discussiones Mathematicae Graph Theory, 2017 A distinguishing coloring of a graph G is a coloring of the vertices so that every nontrivial automorphism of G maps some vertex to a vertex with a different color. The distinguishing number of G is the minimum k such that G has a distinguishing coloring
Immel Poppy, Wenger Paul S.
doaj +1 more source
Mathematics, 2019 Fuzzy graphs (FGs) and their generalizations have played an essential role in dealing with real-life problems involving uncertainties. The goal of this article is to show some serious flaws in the existing definitions of several root-level generalized FG
Naeem Jan +6 more
doaj +1 more source