Results 11 to 20 of about 70,417 (125)
On Models of Directed Path Graphs Non Rooted Directed Path Graphs [PDF]
Graphs and Combinatorics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gutiérrez, Marisa +1 more
semanticscholar +13 more sources
Asteroids in rooted and directed path graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 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 +5 more sources
Special asteroidal quadruple on directed path graph non rooted path graph [PDF]
Electronic Notes in Discrete Mathematics, 2013 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 +2 more sources
Rooted directed path graphs are leaf powers
Discrete Mathematics, 2010 Leaf powers are a graph class which has been introduced to model the problem of reconstructing phylogenetic trees. A graph \(G=(V,E)\) is called \(k\)-leaf power if it admits a \(k\)-leaf root, i.e., a tree \(T\) with leaves \(V\) such that \(uv\) is an edge in \(G\) if and only if the distance between \(u\) and \(v\) in \(T\) is at most \(k ...
Brandstädt, Andreas +3 more
openaire +3 more sources
Matemática Contemporânea, 2015 An asteroidal triple in a graph 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.
Marisa Gutierrez, S Tondato
openaire +2 more sources
Asteroidal Quadruples in non Rooted Path Graphs
Discussiones Mathematicae Graph Theory, 2015 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.
M. Gutierrez +2 more
semanticscholar +2 more sources
Recognizing clique graphs of directed and rooted path graphs
Discrete Applied Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prisner, Erich, Szwarcfiter, Jayme L.
openaire +3 more sources
Counting Dominating Sets in Directed Path Graphs [PDF]
arXiv.org, 2022 A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its subclass of ...
Min-Sheng Lin
semanticscholar +1 more source
Twin-width VIII: delineation and win-wins [PDF]
International Symposium on Parameterized and Exact Computation, 2022 We introduce the notion of delineation. A graph class $\mathcal C$ is said delineated if for every hereditary closure $\mathcal D$ of a subclass of $\mathcal C$, it holds that $\mathcal D$ has bounded twin-width if and only if $\mathcal D$ is monadically
Édouard Bonnet +5 more
semanticscholar +1 more source
A distributed algorithm for directed minimum-weight spanning tree
Distributed computing, 2021 In the directed minimum spanning tree problem (DMST, also called minimum weight arborescence ), we are given a directed weighted graph, and a root node r .
O. Fischer, R. Oshman
semanticscholar +1 more source