Results 1 to 10 of about 89,424 (62)
Asteroidal Quadruples in non Rooted Path Graphs [PDF]
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.
Gutierrez Marisa +2 more
doaj +15 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
semanticscholar +6 more sources
On Models of Directed Path Graphs Non Rooted Directed Path Graphs [PDF]
Graphs Comb., 2016 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. An asteroidal quadruple is a stable set of four vertices such that any three of them is an asteroidal triple.
M. Gutierrez, S. Tondato
semanticscholar +9 more sources
First observation of a quadruple asteroid [PDF]
Astronomy & Astrophysics, 2022 Context.Extreme adaptive optics systems, such as the Spectro-Polarimetric High-contrast Exoplanet REsearch facility (SPHERE), push forward the limits in high contrast and high resolution in direct imaging. The main objectives of these instruments are exoplanet detection and characterisation.Aims.We aim to increase the contrast limits to detect new ...
Anthony Berdeu +2 more
openaire +3 more sources
Obstructions to chordal circular-arc graphs of small independence number [PDF]
Electron. Notes Discret. Math., 2012 A blocking quadruple (BQ) is a quadruple of vertices of a graph such that any two vertices of the quadruple either miss (have no neighbours on) some path connecting the remaining two vertices of the quadruple, or are connected by some path missed by the ...
Mathew C. Francis, P. Hell, J. Stacho
semanticscholar +1 more source
Black hole mergers from quadruples [PDF]
Monthly notices of the Royal Astronomical Society, 2019 With the hundreds of merging binary black hole (BH) signals expected to be detected by LIGO/Virgo, LISA and other instruments in the next few years, the modeling of astrophysical channels that lead to the formation of compact-object binaries has become ...
G. Fragione, B. Kocsis
semanticscholar +1 more source
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs [PDF]
, 2022 A bipartite graph G=(U,V,E) is convex if the vertices in V can be linearly ordered such that for each vertex u∈U, the neighbors of u are consecutive in the ordering of V.
Klemz, Boris, Rote, Günter
core +1 more source
Two New Characterizations of Path Graphs [PDF]
, 2022 Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141--181] and we reduce it
Apollonio, Nicola, Balzotti, Lorenzo
core +2 more sources
AERODYNAMIC SEPARATION OF FRAGMENTED BODIES IN HIGH-SPEED FLOW [PDF]
, 2021 Atmospheric entry of meteoroids poses danger to humans in the form of blast-wave overpressure, impact craters, tsunamis, and other assorted threats. The relative risks of each are highly dependent on the details of the unavoidable structural disruption ...
Whalen, Thomas James
core +1 more source
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.
M. Gutierrez, S. Tondato
semanticscholar +1 more source