Results 31 to 40 of about 3,018,719 (345)
Reconstruction of interval graphs
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kiyomi, Masashi +2 more
openaire +2 more sources
On Generalizations of Pairwise Compatibility Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri +3 more
doaj +1 more source
Novel Concept of Interval-Valued Neutrosophic Incidence Graphs with Application [PDF]
Neutrosophic Sets and Systems, 2021 : Neutrosophic set (NS) is a framework used when the imprecision and uncertainty of an event are described based on three possible aspects, i.e., the membership degree, neutral membership degree and non-membership degree.
Siti Nurul Fitriah Mohamad +4 more
doaj +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
End Simplicial Vertices in Path Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree.
Gutierrez Marisa, Tondato Silvia B.
doaj +1 more source
On Homogeneously Representable Interval Graphs [PDF]
National Academy Science Letters, 2015 We determine all graphs whose line graphs (middle graphs, total graphs, respectively) are homogeneously representable interval graphs.
Krzywkowski, Marcin, Topp, Jerzy
openaire +1 more source
On the Representation of a PI-Graph
Trends in Computational and Applied Mathematics, 2007 Consider two parallel lines (denoted r1 and r2). A graph is a PI graph (Point-Interval graph) if it is an intersection graph of a family F of triangles between r1 and r2 such that each triangle has an interval with two endpoints on r1 and a vertex (a ...
S.M. Almeida, C.P. de Mello, A. Gomide
doaj +1 more source
Incidence matrices and interval graphs [PDF]
Pacific Journal of Mathematics, 1965 Abstract : According to present genetic theory, the fine structure of genes consists of linearly ordered elements. A mutant gene is obtained by alteration of some connected portion of this structure. By examining data obtained from suitable experiments, it can be determined whether or not the blemished portions of two mutant genes intersect or not, and
Fulkerson, D. R., Gross, O. A.
openaire +3 more sources
Interval-valued bipolar fuzzy line graphs
BMC Research Notes, 2023 Objectives The notion of Bipolarity based on positive and negative outcomes. It is well known that bipolar models give more precision, flexibility, and compatibility to the system as compared to the classical models and fuzzy models.
Keneni Abera Tola +2 more
doaj +1 more source
Betweenness in graphs: A short survey on shortest and induced path betweenness
AKCE International Journal of Graphs and Combinatorics, 2019 Betweenness is a universal notion present in several disciplines of mathematics. The notion of betweenness has a profound history and many pioneers like Euclid, Pasch, Hilbert have studied betweenness axiomatically.
Manoj Changat +2 more
doaj +2 more sources