Results 1 to 10 of about 226,666 (311)

On some subclasses of interval catch digraphs

open access: yesElectronic Journal of Graph Theory and Applications, 2022
A digraph G = (V, E) is an interval catch digraph if for each vertex v ∈ V, one can associate an interval on real line and a point within it (say (Iv, pv)) in such a way that uv ∈ E if and only if pv ∈ Iu. It was introduced by Maehara in 1984.
Sanchita Paul, Shamik Ghosh
doaj   +1 more source

-labeling of interval graphs

open access: yesInternational 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

On characterizing proper max-point-tolerance graphs

open access: yesAKCE 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

A four-sweep LBFS recognition algorithm for interval graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Graph ...
Peng Li, Yaokun Wu
doaj   +1 more source

Certain operations on interval-valued picture fuzzy graphs with application

open access: yesInternational 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

Cleaning Interval Graphs [PDF]

open access: yesAlgorithmica, 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

Classes of graphs with restricted interval models [PDF]

open access: yesDiscrete 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.
Andrzej Proskurowski, Jan Arne Telle
doaj   +2 more sources

On central max-point-tolerance graphs

open access: yesAKCE 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

Energy and Spectrum Analysis of Interval Valued Neutrosophic Graph using MATLAB [PDF]

open access: yesNeutrosophic Sets and Systems, 2019
In recent time graphical analytics of uncertainty and indeterminacy has become major concern for data analytics researchers. In this direction, the mathematical algebra of neutrosophic graph is extended to interval-valued neutrosophic graph.
Said Broumi   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy