Results 31 to 40 of about 3,546,741 (346)
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
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
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
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
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
Open-interval graphs versus closed-interval graphs
Discrete Mathematics, 1987 It is proved that a countable graph is a closed-interval graph if and only if it is an open-interval graph. A counter-example is given for uncountable graphs. Also the case of unit length intervals is studied.
Hiroshi Maehara, Peter Frankl
openaire +3 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
Computing and counting longest paths on circular-arc graphs in polynomial time. [PDF]
, 2011 The longest path problem asks for a path with the largest number of vertices in a given graph. The first polynomial time algorithm (with running time O(n4)) has been recently developed for interval graphs.
Cuntz +7 more
core +3 more sources
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peisen Zhang, Chi Wang, Fred R. McMorris
openaire +3 more sources
A Characterization of 2-Tree Probe Interval Graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs ...
Brown David E. +2 more
doaj +1 more source