Results 31 to 40 of about 107,276 (264)
, 1998 We answer a variant of a question of Rodl and Voigt by showing that, for a given infinite cardinal lambda, there is a graph G of cardinality kappa =(2^lambda)^+ such that for any colouring of the edges of G with lambda colours, there is an induced copy of the kappa-tree in G in the set theoretic sense with all edges having the same colour.
Milner, Eric C., Shelah, Saharon
openaire +2 more sources
On the Maximum ABS Index of Fixed-Order Trees with a Given Maximum Degree
MathematicsThe ABS (atom-bond sum-connectivity) index of a graph G is denoted by ABS(G) and is defined as ∑xy∈E(G)(dx+dy)−1(dx+dy−2), where dx represents the degree of the vertex x in G.
Venkatesan Maitreyi +5 more
doaj +1 more source
Collective Tree Spanners of Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2004 In this paper we introduce a new notion of collective tree spanners. We say that a graph G=(V,E)admits a system of $\mu$ collective additive tree r-spanners if there is a system T(G) of at most $\mu$ spanning trees of G such that for any two vertices x,y of G a spanning tree T\in \cT(G) exists such that d_T(x,y)\leq d_G(x,y)+r.
Feodor F. Dragan +2 more
openaire +1 more source
SGIR-Tree: Integrating R-Tree Spatial Indexing as Subgraphs in Graph Database Management Systems
ISPRS International Journal of Geo-InformationEfficient spatial query processing in Graph Database Management Systems (GDBMSs) has become increasingly important owing to the prevalence of spatial graph data.
Juyoung Kim +4 more
doaj +1 more source
The Spanning Tree of a Divisible Multiple Graph
Моделирование и анализ информационных систем, 2018 In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges.
Alexander V. Smirnov
doaj +1 more source
Building Graphs from Colored Trees [PDF]
The Electronic Journal of Combinatorics, 2010 We will explore the computational complexity of satisfying certain sets of neighborhood conditions in graphs with various properties. More precisely, fix a radius $\rho$ and let $N(G)$ be the set of isomorphism classes of $\rho$-neighborhoods of vertices of $G$ where $G$ is a graph whose vertices are colored (not necessarily properly) by colors from a
Esselstein, Rachel M., Winkler, Peter
openaire +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Multiple sclerosis (MS) exhibits racially disparate rates of disease progression. Black people with MS (B‐PwMS) experience a more severe disease course than non‐Hispanic White people with MS (NHW‐PwMS). Here we investigated structural and functional connectivity as well as structure–function decoupling in the ...
Emilio Cipriano +11 more
wiley +1 more source
Building direct and back spanning trees by automata on a graph
Труды Института системного программирования РАН, 2018 The paper presents a parallel graph exploration algorithm. Automaton on a graph is an analogue of the Turing machine тАФ tape cells correspond to graph vertices, where the automaton can store some data, and moves along the tape correspond to moves along ...
Igor Burdonov, Alexander Kossachev
doaj +1 more source
Graph Convolution Over Multiple Latent Context-Aware Graph Structures for Event Detection
IEEE Access, 2020 Event detection is a particularly challenging problem in information extraction. The current neural network models have proved that dependency tree can better capture the correlation between candidate trigger words and related context in the sentence ...
Lei Li +5 more
doaj +1 more source
Random Trees in Random Graphs [PDF]
Proceedings of the American Mathematical Society, 1988 We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled n n -vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n n increases, and the set of trees referred to as "almost all" depends
Bender, E. A., Wormald, N. C.
openaire +2 more sources