Independent sets on path-schemes.

Kitaev, Sergey

Displaying similar documents to “Independent sets on path-schemes.”

On the Turán properties of infinite graphs.

Dudek, Andrzej, Rödl, Vojtech (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The Fibonacci number of a grid graph and a new class of integer sequences.

Euler, Reinhardt (2005)

Journal of Integer Sequences [electronic only]

Similarity:

On the first eigenvalue of bipartite graphs.

Bhattacharya, Amitava, Friedland, Shmuel, Peled, Uri N. (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The visibility parameter for words and permutations

Ligia Cristea, Helmut Prodinger (2013)

Open Mathematics

Similarity:

We investigate the visibility parameter, i.e., the number of visible pairs, first for words over a finite alphabet, then for permutations of the finite set {1, 2, …, n}, and finally for words over an infinite alphabet whose letters occur with geometric probabilities. The results obtained for permutations correct the formula for the expectation obtained in a recent paper by Gutin et al. [Gutin G., Mansour T., Severini S., A characterization of horizontal visibility graphs and combinatorics...

The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.

Zeilberger, Doron (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Inductive computations on graphs defined by clique-width expressions

Frédérique Carrère (2009)

RAIRO - Theoretical Informatics and Applications

Similarity:

Labelling problems for graphs consist in building distributed data structures, making it possible to check a given graph property or to compute a given function, the arguments of which are vertices. For an inductively computable function , if is a graph with vertices and of clique-width at most , where is fixed, we can associate with each vertex of a piece of information (bit sequence) lab(x) of length (log()) such that we can compute in constant time, using only the labels...