Results 21 to 30 of about 3,546,741 (346)
Interval Valued Pentapartitioned Neutrosophic Graphs with an Application to MCDM
Operational Research in Engineering Sciences: Theory and Applications, 2022 The concept of interval valued pentapartitioned neutrosophic set is the extension of interval-valued neutrosophic set, quadripartitioned neutrosophic set, interval valued quadripartitioned neutrosophic set and pentapartitioned neutrosophic set.
Said Broumi +7 more
doaj +1 more source
A four-sweep LBFS recognition algorithm for interval graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Peng Li, Yaokun Wu
doaj +1 more source
On characterizing proper max-point-tolerance graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Max-point-tolerance graphs (MPTG) were introduced by Catanzaro et al. in 2017 as a generalization of interval graphs. This graph class has many practical applications in the study of the human genome as well as in signal processing for networks. The same
Sanchita Paul
doaj +1 more source
Certain operations on interval-valued picture fuzzy graphs with application
International Journal of Mathematics for Industry, 2023 Graph theory has various applications in computer science, such as image segmentation, clustering, data mining, image capturing, and networking. Fuzzy graph (FG) theory has been widely adopted to handle uncertainty in graph-related problems.
Biswajit Das Adhikari +3 more
doaj +1 more source
A note on the interval number of a graph
Discrete Mathematics, 1985 Three results on the interval number \(i(G)\) and d-dimensional interval number \(i_d(G)\) of a graph \(G\) with n vertices are presented. Theorem 1. The inequalities \(i(G)\geq n/4 lg_2 n\), \(i_d(G)\geq n/4d lg_2 n\) hold for almost every graph (i.e.
Paul Erdős, Douglas B. West
openalex +4 more sources
Reconstruction of interval graphs [PDF]
Theoretical Computer Science, 2009 AbstractThe graph reconstruction conjecture is a long-standing open problem in graph theory. There are many algorithmic studies related to it, such as DECK CHECKING, LEGITIMATE DECK, PREIMAGE CONSTRUCTION, and PREIMAGE COUNTING. We study these algorithmic problems by limiting the graph class to interval graphs.
Masashi Kiyomi +2 more
openaire +2 more sources
The total interval number of a graph
Journal of Combinatorial Theory, Series B, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas Andreae, Martin Aigner
openalex +3 more sources
On the enumeration of interval graphs [PDF]
Proceedings of the American Mathematical Society, Series B, 2017 We present upper and lower bounds for the number i n i_n of interval graphs on n n vertices. Answering a question posed by Hanlon, we show that the ordinary generating function I ( x ) = ∑ n ≥ 0
Joyce C. Yang, Nicholas Pippenger
openaire +2 more sources
Cleaning Interval Graphs [PDF]
Algorithmica, 2010 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
openalex +5 more sources
On central max-point-tolerance graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Max-point-tolerance graphs (MPTG) were studied by Catanzaro et al. in 2017 and the same class of graphs were introduced in the name of p-BOX(1) graphs by Soto and Caro in 2015.
Sanchita Paul
doaj +1 more source