Results 1 to 10 of about 2,615 (201)
Asteroidal Quadruples in non Rooted Path Graphs
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs.
Gutierrez Marisa +2 more
doaj +6 more sources
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two elements and is ...
Matteo Cavaleri +3 more
doaj +1 more source
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees [PDF]
Binary relations derived from labeled rooted trees play an import role in mathematical biology as formal models of evolutionary relationships. The (symmetrized) Fitch relation formalizes xenology as the pairs of genes separated by at least one horizontal
Marc Hellmuth +2 more
doaj +1 more source
Representation Model of Agricultural Knowledge Graph Based on the HARP Framework [PDF]
[Purpose/Significance] In the era of big data, the volume of data is growing at an exponential rate. One of the most prominent areas affected by this growth is the field of agriculture.
CHEN Caiming, FENG Jianzhong, BAI Linyan, WANG Jian, XIE Nengfu, ZOU Jun
doaj +1 more source
On Models of Directed Path Graphs Non Rooted Directed Path Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gutiérrez, Marisa +1 more
openaire +3 more sources
Computing Fault-Tolerant Metric Dimension of Connected Graphs
For a connected graph, the concept of metric dimension contributes an important role in computer networking and in the formation of chemical structures.
Uzma Ahmad +3 more
doaj +1 more source
Installing obstructions in the path of the flowing stream in a Convergent-Divergent channel results in complex Reynolds Navier-Stokes (NS)-equations and an exact solution in this direction is not feasible.
Khalil Ur Rehman +4 more
doaj +1 more source
Special asteroidal quadruple on directed path graph non rooted path graph [PDF]
Abstract An asteroidal triple in a graph G is a set of three non-adjacent vertices such that for any two of them there exists a path between them that does not intersect the neighborhood of the third. A special asteroidal triple in a graph G is an asteroidal triple such that each pair is linked by a special connection.
Marisa Gutierrez, Silvia B. Tondato
openaire +1 more source
Molecular Descriptors on Line Graphs of Cactus Chains and Rooted Products Graphs
The application of graph theory in the study of molecular physical and chemical properties involves theoretical mathematical chemistry. Atoms, represented by vertices, and edges, represented by bonds between them, are detailed in simple graphs called ...
Iftikhar Ahmad +4 more
doaj +1 more source
Asteroids in rooted and directed path graphs [PDF]
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central role in a classical characterization of interval graphs by Lekkerkerker and Boland.
Cameron, Kathie +2 more
openaire +3 more sources

