966 search results - page 9 / 194 » Small Alliances in Graphs |
JCT
2006
14 years 10 months ago
2006
We find the graphs of valency at most 7 with the property that any two nonadjacent vertices have either 0 or 2 common neighbours. In particular, we find all semibiplanes of block ...
84
Voted
COMBINATORICA
2007
14 years 10 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
107
click to vote
EM
2010
14 years 10 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
83
Voted
NETWORKS
2002
14 years 9 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
GD
2007
Springer
15 years 4 months ago
2007
Springer