Results 1 to 10 of about 588,772 (275)
Exactly Hittable Interval Graphs [PDF]
Given a set system $\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$, where $\mathcal{U}$ is a set of elements and $\mathcal{S}$ is a set of subsets of $\mathcal{U}$, an exact hitting set $\mathcal{U}'$ is a subset of $\mathcal{U}$ such that each subset in ...
S. M. Dhannya +2 more
doaj +3 more sources
Closed graphs are proper interval graphs [PDF]
Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
Crupi Marilena, Rinaldo Giancarlo
doaj +2 more sources
Some Connectivity Parameters of Interval-Valued Intuitionistic Fuzzy Graphs with Applications [PDF]
Connectivity in graphs is useful in describing different types of communication systems like neural networks, computer networks, etc. In the design of any network, it is essential to evaluate the connections based on their strengths.
Hao Guan +5 more
doaj +2 more sources
Interval-valued fuzzy graphs [PDF]
We define the Cartesian product, composition, union and join on interval-valued fuzzy graphs and investigate some of their properties. We also introduce the notion of interval-valued fuzzy complete graphs and present some properties of self complementary
Akram +27 more
core +2 more sources
On powers of interval graphs and their orders [PDF]
It was proved by Raychaudhuri in 1987 that if a graph power $G^{k-1}$ is an interval graph, then so is the next power $G^k$. This result was extended to $m$-trapezoid graphs by Flotow in 1995.
Foucaud, Florent +3 more
core +3 more sources
A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures [PDF]
The well-known topic of crisp graph planarity is contrasted with the more new and thoroughly studied field of planarity inside a fuzzy framework. In cubic fuzzy domain, cubic multisets with interval and fuzzy number to capture vagueness.
Deivanai Jaisankar +2 more
doaj +2 more sources
Equivalence of the filament and overlap graphs of subtrees of limited trees [PDF]
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs.
Jessica Enright, Lorna Stewart
doaj +6 more sources
Blockchain Single and Interval Valued Neutrosophic Graphs [PDF]
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 +2 more sources
The power of interval models for computing graph centralities [PDF]
Food webs, some scheduling problems and DNA molecules all have in common a “linear structure” which can be captured through the idealized model of interval graphs (intersection graphs of intervals on a line).
Guillaume DUCOFFE
doaj +1 more source
Classes of graphs with restricted interval models [PDF]
We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs. We initiate a
Andrzej Proskurowski, Jan Arne Telle
doaj +3 more sources

