Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Victor Neumann"'
Publikováno v:
Discrete Applied Mathematics. 161:1427-1439
The clique graph K(G) of a graph G is the intersection graph of all its (maximal) cliques. We explore the effect of operations like edge contraction, edge removal and others on the dynamical behavior of a graph under the iteration of the clique opera
Publikováno v:
Discrete Mathematics. 282(1-3):183-191
The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. The iterated clique graphs Kn(G) are defined by K0(G)=G and Ki(G)=K(Ki−1(G)), i>0 and K is the clique operator. A cograph is a graph with no induced subgrap
Publikováno v:
Discrete Mathematics. 258:123-135
We study the dynamical behaviour of surface triangulations under the iterated application of the clique graph operator k, which transforms each graph G into the intersection graph kG of its (maximal) cliques. A graph G is said to be k-divergent if th
Publikováno v:
Electronic Notes in Discrete Mathematics. 7:10-13
S. Hazan and V. Neumann-Lara proved in 1996 that every finite partially ordered set whose comparability graph is clique null has the fixed point property and they asked whether there is a finite poset with the fixed point property whose comparability
Publikováno v:
Journal of the Brazilian Computer Society v.7 n.3 2001
Journal of the Brazilian Computer Society
Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
Journal of the Brazilian Computer Society, Volume: 7, Issue: 3, Pages: 69-73, Published: 2001
Journal of the Brazilian Computer Society
Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
Journal of the Brazilian Computer Society, Volume: 7, Issue: 3, Pages: 69-73, Published: 2001
If G is a graph, its clique graph K(G) is the intersection graph of all its (maximal) cliques. The complex G of a graph G is the simplicial complex whose simplexes are the vertex sets of the complete subgraphs of G. Here we study a sufficient condi
Autor:
Victor Neumann-Lara, F. Larrión
Publikováno v:
Discrete Mathematics. :491-501
The clique graph kG of a graph G is the intersection graph of the family of all maximal complete subgraphs of G . The iterated clique graphs k n G are defined by k 0 G = G and k n +1 G = kk n G . A graph G is said to be k -divergent if | V ( k n G )|
Autor:
Victor Neumann-Lara, F. Larrión
Publikováno v:
Graphs and Combinatorics. 13:263-266
We present an infinite set A of finite graphs such that for any graph G e A the order | V(k n (G))| of the n-th iterated clique graph k n (G) is a linear function of n. We also give examples of graphs G such that | V(k n(G))| is a polynomial of any g
Publikováno v:
European Journal of Combinatorics. (2):372-379
The clique graph K(G) of a graph G, is the intersection graph of its (maximal) cliques, and G is K-divergent if the orders of its iterated clique graphs K(G),K2(G),K3(G),… tend to infinity. A coaffine graph has a symmetry that maps each vertex outs
Publikováno v:
Discrete Mathematics. (1-3):263-265
Given a graph G and two vertices x,[email protected]?V(G), we say that x is dominated by y if the closed neighbourhood of x is contained in that of y. Here we prove that if x is a dominated vertex, then G and G-{x} have the same dynamical behaviour u