DOIAbstract
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The existence of a graph on n vertices having at least 2n22−cn32 unique subgraphs is proven for c > 32 √2 and n sufficiently large
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The existence of a graph on n vertices having at least 2n22−cn32 unique subgraphs is proven for c > 32 √2 and n sufficiently large
AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n d...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractLet G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs...
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
Consider a pattern graph H with l edges, and a host graph G which may contain several occurrences of...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
Abstract. A locally nK2 graph G is a graph such that the set of neighbors of any vertex of G induces...
Extremal problems involving the enumeration of graph substructures have a long history in graph theo...
AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n d...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractLet G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs...
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
Consider a pattern graph H with l edges, and a host graph G which may contain several occurrences of...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
Abstract. A locally nK2 graph G is a graph such that the set of neighbors of any vertex of G induces...
Extremal problems involving the enumeration of graph substructures have a long history in graph theo...
AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n d...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractLet G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs...
Add to ORKG