Results 11 to 20 of about 586,356 (320)
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
Interval-Valued Neutrosophic Competition Graphs
ANNALS OF FUZZY MATHEMATICS AND INFORMATICS, 2017 We first introduce the concept of interval-valued neutrosophic competition graphs. We then discuss certain types, including k-competition interval-valued neutrosophic graphs, p-competition interval-valued neutrosophic graphs and m-step interval-valued neutrosophic competition graphs.
Muhammad Akram, Maryam Nasir
openalex +3 more sources
International Journal of Data Mining, Modelling and Management, 2018 Frequent subgraph mining is a difficult data mining problem aiming to find the exact set of frequent subgraphs into a database of graphs. Current subgraph mining approaches make use of the canonical encoding which is one of the key operations. It is well known that canonical encodings have an exponential time complexity.
Amina Kemmar, Yahia Lebbah, Samir Loudni
openalex +3 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
Fast Diameter Computation within Split Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 When can we compute the diameter of a graph in quasi linear time? We address this question for the class of {\em split graphs}, that we observe to be the hardest instances for deciding whether the diameter is at most two.
Guillaume Ducoffe +2 more
doaj +1 more source
On Edge Proper Interval-Valued Complex Fuzzy Graphs [PDF]
E3S Web of Conferences, 2023 This article summarizes about edge proper interval-valued complex fuzzy graph. Here, degree of an edge, total degree of an edge, edge proper and edge totally proper intervalvalued complex fuzzy were introduced.
Venkateshwara R., Sridevi R.
doaj +1 more source