Results 31 to 40 of about 3,671,469 (355)
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
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
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. [PDF]
, 2015 We prove that for all inline image an interval graph is inline image-Hamilton-connected if and only if its scattering number is at most k. This complements a previously known fact that an interval graph has a nonnegative scattering number if and only if ...
Broersma, H.J. +5 more
core +2 more sources
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
The Cost of Global Broadcast in Dynamic Radio Networks [PDF]
, 2016 We study the single-message broadcast problem in dynamic radio networks. We show that the time complexity of the problem depends on the amount of stability and connectivity of the dynamic network topology and on the adaptiveness of the adversary ...
Ahmadi, Mohamad +3 more
core +2 more sources
Theoretical Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Naoto Miyoshi +3 more
openaire +1 more source
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
On the Implicit Graph Conjecture [PDF]
, 2016 The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder.
Chandoo, Maurice
core +3 more sources
On Generalizations of Pairwise Compatibility Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri +3 more
doaj +1 more source
Novel Concept of Interval-Valued Neutrosophic Incidence Graphs with Application [PDF]
Neutrosophic Sets and Systems, 2021 : Neutrosophic set (NS) is a framework used when the imprecision and uncertainty of an event are described based on three possible aspects, i.e., the membership degree, neutral membership degree and non-membership degree.
Siti Nurul Fitriah Mohamad +4 more
doaj +1 more source