Results 1 to 10 of about 3,671,469 (355)
Ann Comb, 2013 We work out a graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function W(x, y) on the unit square, with x and y uniform on the interval (0, 1).
Diaconis P, Holmes S, Janson S.
europepmc +8 more sources
Closed graphs are proper interval graphs [PDF]
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
Crupi Marilena, Rinaldo Giancarlo
doaj +2 more sources
Cubicity of interval graphs and the claw number [PDF]
, 2009 Let $G(V,E)$ be a simple, undirected graph where $V$ is the set of vertices and $E$ is the set of edges. A $b$-dimensional cube is a Cartesian product $I_1\times I_2\times...\times I_b$, where each $I_i$ is a closed interval of unit length on the real ...
Adiga, Abhijin, Chandran, L. Sunil
core +3 more sources
Distance Two Surjective Labelling of Paths and Interval Graphs [PDF]
Discrete Dynamics in Nature and Society, 2021 Graph labelling problem has been broadly studied for a long period for its applications, especially in frequency assignment in (mobile) communication system, X-ray crystallography, circuit design, etc.
Sk Amanathulla +3 more
doaj +2 more sources
A new haplotype block detection method for dense genome sequencing data based on interval graph modeling of clusters of highly correlated SNPs. [PDF]
Bioinformatics, 2018 Kim SA, Cho CS, Kim SR, Bull SB, Yoo YJ.
europepmc +2 more sources
On the One Dimensional Poisson Random Geometric Graph [PDF]
Journal of Probability and Statistics, 2011 Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process, and edges exist between two points if and only if their distance is less than a fixed given threshold. We compute
L. Decreusefond, E. Ferraz
doaj +7 more sources
A Note on the Interval Function of a Disconnected Graph
Discussiones Mathematicae Graph Theory, 2018 In this note we extend the Mulder-Nebeský characterization of the interval function of a connected graph to the disconnected case. One axiom needs to be adapted, but also a new axiom is needed in addition.
Changat Manoj +3 more
doaj +2 more sources
On powers of interval graphs and their orders [PDF]
, 2015 It was proved by Raychaudhuri in 1987 that if a graph power $G^{k-1}$ is an interval graph, then so is the next power $G^k$. This result was extended to $m$-trapezoid graphs by Flotow in 1995.
Foucaud, Florent +3 more
core +3 more sources
Time Interval-Enhanced Graph Neural Network for Shared-Account Cross-Domain Sequential Recommendation [PDF]
IEEE Transactions on Neural Networks and Learning Systems, 2022 Shared-account cross-domain sequential recommendation (SCSR) task aims to recommend the next item via leveraging the mixed user behaviors in multiple domains.
Lei Guo +5 more
semanticscholar +1 more source
On some subclasses of interval catch digraphs
Electronic 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