9 search results - page 1 / 2 » Twins of rayless graphs |
JCT
2011
12 years 11 months ago
2011
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
COMBINATORICA
2010
12 years 11 months ago
2010
We prove that every rayless graph has an unfriendly partition.
DAM
2002
13 years 4 months ago
2002
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...
COMBINATORICS
2007
13 years 4 months ago
2007
DAWAK
2010
Springer
13 years 5 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...