Results 231 to 240 of about 5,057 (262)

Nonlinear modal evolution of microbubbles confined by rigid capillary constraint. [PDF]

Ultrason Sonochem
Li X, Mo R, Wu Y, Liu Y, Ma J, Zuo X, Lei Z, Wu Y, Liang Z, Han L, Wang C.   +10 more
europepmc   +1 more source

A hardware demonstration of a universal programmable RRAM-based probabilistic computer for molecular docking. [PDF]

Nat Commun
He Y, Hong MC, Ding Q, Lin CS, Lai CM, Fang C, Gong X, Hou TH, Liang G.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

INDUCED SUBGRAPHS OF GAMMA GRAPHS

Discrete Mathematics, Algorithms and Applications, 2013
Let G be a graph. The gamma graph of G denoted by γ ⋅ G is the graph with vertex set V(γ ⋅ G) as the set of all γ-sets of G and two vertices D and S of γ ⋅ G are adjacent if and only if |D ∩ S| = γ(G) – 1. A graph H is said to be a γ-graph if there exists a graph G such that γ ⋅ G is isomorphic to H.
N. Sridharan, S. Amutha, S. B. Rao
openaire   +1 more source

Excluding induced subgraphs: quadrilaterals

Random Structures & Algorithms, 1991
AbstractIn this note we determine the structure of “almost all” graphs not containing a quadrilateral (i.e., a cycle of length four) as an induced subgraph. In particular, it turns out that there are asymptotically twice as many graphs not containing an induced quadrilateral than there are bipartite graphs.
Hans Jürgen Prömel, Angelika Steger
openaire   +1 more source

On induced subgraphs of a block

Journal of Graph Theory, 1977
AbstractIf G is a block, then a vertex u of G is called critical if G ‐ u is not a block. In this article, relationships between the localization of critical vertices and the localization of vertices of relatively small degrees (especially, of degree two) are studied. A block is called semicritical if a) each edge is incident with at least one critical
openaire   +2 more sources

Large Nearly Regular Induced Subgraphs [PDF]

SIAM Journal on Discrete Mathematics, 2008
For a real c \geq 1 and an integer n, let f(n,c) denote the maximum integer f so that every graph on n vertices contains an induced subgraph on at least f vertices in which the maximum degree is at most c times the minimum degree. Thus, in particular, every graph on n vertices contains a regular induced subgraph on at least f(n,1) vertices. The problem
Noga Alon, Michael Krivelevich, Benny Sudakov   +2 more
exaly   +3 more sources

Matroids Induced by Packing Subgraphs

SIAM Journal on Discrete Mathematics, 2004
Summary: This paper is concerned with the classification of families of graphs \(\mathcal T\) with the following property: For any graph \(G\), the subsets of vertices of \(G\) that can be saturated by packing copies of graphs from \(\mathcal T\) form a collection of independent sets of a matroid.
openaire   +2 more sources

Maximum k-regular induced subgraphs [PDF]

Journal of Combinatorial Optimization, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Domingos Moreira Cardoso, Marcin Kaminski 0001, Vadim V. Lozin   +2 more
openaire   +2 more sources

Factors and Connected Induced Subgraphs

Graphs and Combinatorics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source