Results 21 to 30 of about 3,671,469 (355)
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.
Andrzej Proskurowski, Jan Arne Telle
doaj +2 more sources
Energy and Spectrum Analysis of Interval Valued Neutrosophic Graph using MATLAB [PDF]
Neutrosophic 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
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
An Extension of Fuzzy Competition Graph and Its Uses in Manufacturing Industries
Mathematics, 2020 Competition graph is a graph which constitutes from a directed graph (digraph) with an edge between two vertices if they have some common preys in the digraph.
Tarasankar Pramanik +3 more
doaj +1 more source
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
Extremal Values of the Interval Number of a Graph [PDF]
, 1980 The interval number $i( G )$ of a simple graph $G$ is the smallest number $t$ such that to each vertex in $G$ there can be assigned a collection of at most $t$ finite closed intervals on the real line so that there is an edge between vertices $v$ and $w$
B. West, Douglas, Jerrold R. Griggs
core +1 more source
Algorithms for optimal min hop and foremost paths in interval temporal graphs
Applied Network Science, 2022 Path problems are fundamental to the study of graphs. Temporal graphs are graphs in which the edges connecting the vertices change with time. Min hop paths problem in a temporal graph is the problem of finding time respecting paths from source vertex to ...
Anuj Jain, Sartaj K. Sahni
doaj +1 more source
OBDD-Based Representation of Interval Graphs [PDF]
, 2013 A graph $G = (V,E)$ can be described by the characteristic function of the edge set $\chi_E$ which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using \emph{Ordered Binary Decision Diagrams} (OBDDs) to store $\chi_E$ can lead to a (
B. Bollig +22 more
core +1 more source
Counting interval graphs [PDF]
Transactions of the American Mathematical Society, 1982 In this paper we enumerate interval graphs (up to isomorphism) along with labelled interval graphs, identity interval graphs, transitive interval graphs and various sorts of unit interval graphs. The enumeration makes use of a structural decomposition of interval graphs which leads to a characterization of those interval graphs having a unique interval
openaire +2 more sources
The Phylogeny Graphs of Doubly Partial Orders
Discussiones Mathematicae Graph Theory, 2013 The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced
Park Boram, Sano Yoshio
doaj +1 more source