Add to ORKGWe enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some cases, construct the corresponding bijections
We study some counting and enumeration problems for chordal graphs, especially concerning independen...
AbstractIn this paper we prove that for every positive integer n there exist a bipartite graph with ...
An outindependent subgraph of a graph G, with respect to an independent vertex subset C¿¿V, is the s...
We enumerate the independent sets of several classes of regular and almost regular graphs and comput...
AbstractNew upper bounds for the number of independent sets in graphs are obtained
Amongst d-regular r-uniform hypergraphs on n vertices, which ones have the largest number of indepen...
AbstractIn this paper, we determine upper and lower bounds for the number of independent sets in a u...
We give the generating function for the number of independent sets on the class of well-based path-s...
We give the generating function for the number of independent sets on the class of well-based path-s...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
In this paper, we study the independence number of various classes of I-graphs. I-graphs are general...
Abstract: We prove a conjecture of Alon on the number of independent sets in a regular graph, and th...
Settling Kahn's conjecture (2001), we prove the following upper bound on the number i(G) of independ...
AbstractWe study some counting and enumeration problems for chordal graphs, especially concerning in...
AbstractAn independent set of a graph is a subset of pairwise non-adjacent vertices. A complete bipa...
We study some counting and enumeration problems for chordal graphs, especially concerning independen...
AbstractIn this paper we prove that for every positive integer n there exist a bipartite graph with ...
An outindependent subgraph of a graph G, with respect to an independent vertex subset C¿¿V, is the s...
We enumerate the independent sets of several classes of regular and almost regular graphs and comput...
AbstractNew upper bounds for the number of independent sets in graphs are obtained
Amongst d-regular r-uniform hypergraphs on n vertices, which ones have the largest number of indepen...
AbstractIn this paper, we determine upper and lower bounds for the number of independent sets in a u...
We give the generating function for the number of independent sets on the class of well-based path-s...
We give the generating function for the number of independent sets on the class of well-based path-s...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
In this paper, we study the independence number of various classes of I-graphs. I-graphs are general...
Abstract: We prove a conjecture of Alon on the number of independent sets in a regular graph, and th...
Settling Kahn's conjecture (2001), we prove the following upper bound on the number i(G) of independ...
AbstractWe study some counting and enumeration problems for chordal graphs, especially concerning in...
AbstractAn independent set of a graph is a subset of pairwise non-adjacent vertices. A complete bipa...
We study some counting and enumeration problems for chordal graphs, especially concerning independen...
AbstractIn this paper we prove that for every positive integer n there exist a bipartite graph with ...
An outindependent subgraph of a graph G, with respect to an independent vertex subset C¿¿V, is the s...