Results 1 to 10 of about 147,371 (263)
Exactly Hittable Interval Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 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
A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures [PDF]
Scientific ReportsThe 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
Interval-Valued Fuzzy Soft Graphs
Topological Algebra and its Applications, 2017 In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur +2 more
doaj +2 more sources
The power of interval models for computing graph centralities [PDF]
Revista Română de Informatică și Automatică, 2022 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]
Discrete Mathematics & Theoretical Computer Science, 1999 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
International Journal of Mathematics for Industry, 2022 [Formula: see text]-labeling problem ([Formula: see text]-[Formula: see text]) is an important topic in discrete mathematics due to its various applications, like in frequency assignment in mobile communication systems, signal processing, circuit design,
Sk. Amanathulla +2 more
doaj +1 more source
Efficient enumeration of non-isomorphic interval graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Recently, Yamazaki et al. provided an algorithm that enumerates all non-isomorphic interval graphs on $n$ vertices with an $O(n^4)$ time delay. In this paper, we improve their algorithm and achieve $O(n^3 \log n)$ time delay.
Patryk Mikos
doaj +1 more source
Cleaning Interval Graphs [PDF]
Algorithmica, 2011 We investigate a special case of the Induced Subgraph Isomorphism problem, where both input graphs are interval graphs. We show the NP-hardness of this problem, and we prove fixed-parameter tractability of the problem with non-standard parameterization, where the parameter is the difference |V(G)|-|V(H)|, with G and H being the larger and the smaller ...
Dániel Marx, Ildikó Schlotter
openaire +3 more sources
Some Connectivity Parameters of Interval-Valued Intuitionistic Fuzzy Graphs with Applications
Axioms, 2023 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 +1 more source