Results 11 to 20 of about 107,276 (264)
Tree++: Truncated Tree Based Graph Kernels [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2021 Graph-structured data arise ubiquitously in many application domains. A fundamental problem is to quantify their similarities. Graph kernels are often used for this purpose, which decompose graphs into substructures and compare these substructures. However, most of the existing graph kernels do not have the property of scale-adaptivity, i.e., they ...
Wei Ye +3 more
openaire +4 more sources
Noncrossing Trees and Noncrossing Graphs [PDF]
The Electronic Journal of Combinatorics, 2006 We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of Panholzer and Prodinger for noncrossing trees and find a correspondence between a class of noncrossing trees, called
Chen, William Y. C., Yan, Sherry H. F.
openaire +3 more sources
On expansive and anti-expansive tree maps [PDF]
Opuscula Mathematica, 2018 With every self-map on the vertex set of a finite tree one can associate the directed graph of a special type which is called the Markov graph. Expansive and anti-expansive tree maps are two extremal classes of maps with respect to the number of loops in
Sergiy Kozerenko
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alcón, Liliana Graciela +4 more
openaire +3 more sources
Signed graphs connected with the root lattice
Bibechana, 2014 For any base of the root lattice (An) we can construct a signed graph. A signed graph is one whose edges are signed by +1 or -1. A signed graph is balanced if and only if its vertex set can be divided into two sets-either of which may be empty–so that ...
RN Yadav
doaj +3 more sources
Toward Adaptability of E-Evaluation: Transformation from Tree-Based to Graph-Based Structure
Applied Sciences, 2021 The COVID-19 pandemic and quarantine have forced students to use distance learning. Modern information technologies have enabled global e-learning usage but also revealed a lack of personalization and adaptation in the learning process when compared to ...
Asta Margienė, Simona Ramanauskaitė
doaj +1 more source
Recognizing Graph Search Trees
Electronic Notes in Theoretical Computer Science, 2019 Graph searches and the corresponding search trees can exhibit important structural properties and are used in various graph algorithms. The problem of deciding whether a given spanning tree of a graph is a search tree of a particular search on this graph was introduced by Hagerup and Nowak in 1985, and independently by Korach and Ostfeld in 1989 where ...
Beisegel, Jesse +6 more
openaire +3 more sources
The Electronic Journal of Combinatorics, 2016 Erdős and Simonovits proved that the number of paths of length $t$ in an $n$-vertex graph of average degree $d$ is at least $(1 - \delta) nd(d - 1) \cdots (d - t + 1)$, where $\delta = (\log d)^{-1/2 + o(1)}$ as $d \rightarrow \infty$. In this paper, we strengthen and generalize this result as follows. Let $T$ be a tree with $t$ edges.
Verstraete, Jacques, Mubayi, Dhruv
openaire +2 more sources
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2012 One of useful graph theory to solve the real problems is Minimum Spanning Tree (MST). MST is network optimization problems that can be applied in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005).
Swaditya Rizki
doaj +1 more source