DOIAbstract
AbstractLet G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs of G and k⩾1. We prove that if i(G)=o(nk+1) then by omitting o(n) vertices the graph can be made (l,m)-almost canonical with l+m⩽k+1
AbstractLet G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs of G and k⩾1. We prove that if i(G)=o(nk+1) then by omitting o(n) vertices the graph can be made (l,m)-almost canonical with l+m⩽k+1
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
Let b be a positive integer-valued function on the set of vertices of a finite graph G. We give a ne...
AbstractLet G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
AbstractWe investigate the maximum number of ways in which a k-vertex graph G can appear as an induc...
AbstractThe paper presents some results on graphs that do not have two distinct isomorphic spanning ...
AbstractThe following theorem is proved: Let G be a finite graph with cl(G) = m, where cl(G) is the ...
AbstractWe give an upper bound for ω(A), the minimum cyclomatic number of connected induced subgraph...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
AbstractThe graphs with exactly one, two or three independent edges are determined
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
Let b be a positive integer-valued function on the set of vertices of a finite graph G. We give a ne...
AbstractLet G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
AbstractWe investigate the maximum number of ways in which a k-vertex graph G can appear as an induc...
AbstractThe paper presents some results on graphs that do not have two distinct isomorphic spanning ...
AbstractThe following theorem is proved: Let G be a finite graph with cl(G) = m, where cl(G) is the ...
AbstractWe give an upper bound for ω(A), the minimum cyclomatic number of connected induced subgraph...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
AbstractThe graphs with exactly one, two or three independent edges are determined
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
Let b be a positive integer-valued function on the set of vertices of a finite graph G. We give a ne...
Add to ORKG