Results 1 to 10 of about 71,937 (189)
Graph classes and forbidden patterns on three vertices [PDF]
This paper deals with graph classes characterization and recognition. A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs.
Feuilloley, Laurent, Habib, Michel
core +1 more source
Perfect Elimination Orderings for Symmetric Matrices [PDF]
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices.
Laurent, Monique, Tanigawa, Shin-ichi
core +5 more sources
Shared and Distinct Features of Human Milk and Infant Stool Viromes. [PDF]
Infants acquire many of their microbes from their mothers during the birth process. The acquisition of these microbes is believed to be critical in the development of the infant immune system.
Abdul A. Saboory +9 more
core +2 more sources
Genome-wide gene expression analysis of anguillid herpesvirus 1 [PDF]
<p>Background: Whereas temporal gene expression in mammalian herpesviruses has been studied extensively, little is known about gene expression in fish herpesviruses.
Davison, A.J. +4 more
core +3 more sources
Elastic properties of proteins: insight on the folding process and evolutionary selection of native structures [PDF]
We carry out a theoretical study of the vibrational and relaxation properties of naturally-occurring proteins with the purpose of characterizing both the folding and equilibrium thermodynamics.
Ala +72 more
core +1 more source
The Fractal Dimension of SAT Formulas [PDF]
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental testing process.
Ansótegui, C. +3 more
core +3 more sources
The zero forcing polynomial of a graph
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to become colored.
Boyer, Kirk +7 more
core +1 more source
Asymptotic Delsarte cliques in distance-regular graphs [PDF]
We give a new bound on the parameter $\lambda$ (number of common neighbors of a pair of adjacent vertices) in a distance-regular graph $G$, improving and generalizing bounds for strongly regular graphs by Spielman (1996) and Pyber (2014).
Babai, László, Wilmes, John
core +2 more sources
How Many Pairwise Preferences Do We Need to Rank A Graph Consistently?
We consider the problem of optimal recovery of true ranking of $n$ items from a randomly chosen subset of their pairwise preferences. It is well known that without any further assumption, one requires a sample size of $\Omega(n^2)$ for the purpose.
Bhattacharyya, Chiranjib +2 more
core +1 more source
Edge-Stable Equimatchable Graphs
A graph $G$ is \emph{equimatchable} if every maximal matching of $G$ has the same cardinality. We are interested in equimatchable graphs such that the removal of any edge from the graph preserves the equimatchability.
Deniz, Zakir, Ekim, Tınaz
core +1 more source

