Results 1 to 10 of about 151,814 (267)
Mapping RDF Databases to Property Graph Databases
IEEE Access, 2020 RDF triplestores and property graph databases are two approaches for data management which are based on modeling, storing and querying graph-like data. In spite of such common principle, they present special features that complicate the task of database ...
Renzo Angles +2 more
doaj +3 more sources
Perfectness is an Elusive Graph Property [PDF]
SIAM Journal on Computing, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Hougardy
exaly +3 more sources
Graph Rigidity Properties of Ramanujan Graphs
The Electronic Journal of Combinatorics, 2023 A recent result of Cioabă, Dewar and Gu implies that any $k$-regular Ramanujan graph with $k \geq 8$ is globally rigid in $\mathbb{R}^2$. In this paper, we extend these results and prove that any $k$-regular Ramanujan graph of sufficiently large order is globally rigid in $\mathbb{R}^2$ when $k\in \{6, 7\}$, and when $k\in \{4,5\}$ if it is also vertex-
Sebastian M. Cioaba +3 more
openaire +4 more sources
On weighted noncorona graphs with properties R and −SR
Kuwait Journal of Science, 2023 Let $\mathfrak{G}_w$ be a simple undirected weighted graph with adjacency matrix $\mathcal{A}(\mathfrak{G}_w)$. The set of all eigenvalues of $\mathfrak{G}_w$ is called the spectrum of $\mathfrak{G}_w$ denoted by $\sigma(\mathfrak{G}_w)$. The reciprocal
Uzma Ahmad, saira Hameed, sadia Akhtar
doaj +1 more source
Homotopy Covers of Graphs and Lifting Property
Wasit Journal for Pure Sciences, 2023 The aim of this paper We create requirements for a graph cover to have the homotopy lifting property of topological space covers, or A-Homotopy lifting property.
salwan abdlwahab, Daher W. Al Baydli
doaj +1 more source
Ramseyan Properties of Graphs [PDF]
The Electronic Journal of Combinatorics, 1996 Every graph of chromatic number $k$ with more than $k(r-1)(b-1)$ vertices has a $b$-element independent set of vertices such that if any two of them are joined by an edge then the chromatic number stays the same or a $r$-element independent set of vertices such that joining any two of them by an edge increases the chromatic number.
Ermelinda DeLaViña, Siemion Fajtlowicz
openaire +2 more sources
A Modified Evolutionary Algorithm for Generating the Cycling Training Routes
IEEE Access, 2022 We present a novel method for generating cycling training routes from geographical property graphs based on an Evolutionary Algorithm. The algorithm operators of crossover and mutation are adjusted for use in the Property Graph domain.
Alen Rajsp, Iztok Fister
doaj +1 more source
The Perception of Graph Properties in Graph Layouts [PDF]
Computer Graphics Forum, 2018 AbstractWhen looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms ...
Utkarsh Soni +5 more
openaire +2 more sources
Graph properties, graph limits, and entropy [PDF]
Journal of Graph Theory, 2017 AbstractWe study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the coloring number, which by well‐known results describes the rate of growth. We study also random graphs and their entropies.
Hatami, H. +2 more
openaire +4 more sources
Mapping RDF Graphs to Property Graphs [PDF]
CoRR, 2018 Increasing amounts of scientific and social data are published in the Resource Description Framework (RDF). Although the RDF data can be queried using the SPARQL language, even the SPARQL-based operation has a limitation in implementing traversal or analytical algorithms.
Shota Matsumoto +2 more
openaire +2 more sources