REGULAR PARTITIONS OFGRAPHS bY School of Humanities and Sciences kSzemeridi, E
of the whole graph under this dynamics, with and without a constraint on the time needed for the complete activation. this problem encompasses in special cases many extremal characteristics of graphs like their independence, decycling or domination number, and can also be seen as a packing problem...
Twitter Google Share on Facebook regular graph Wikipedia regular graph [′reg·gə·lər ¦graf] (mathematics) A graph whose vertices all have the same degree. McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc. ...
Entanglement of embedded graphs - Toen Castle 51:54 Entropy, Mahler Measure and Bernoulli Convolutions - Emmanuel Breuillard 56:16 Extensions of the Gross-Zagier formula - Kartik Prasanna 01:02:01 Group theoretic applications of the large sieve method - Chen Meiri 38:24 Heegaard Biagrams ...
These are the same as regular graphs and such 1-designs abound. Finally, we point out that, when k = 1, the entire vertex set of J(v, 1) is a trivial 1-design. Henceforth, we assume k > 2 and v > 2k. 3. A representation approach Let C be a completely regular design of ...
In [1], equitable partitions of Latin square graphs are studied and those whose quotient matrix does not have an eigenvalue −3 are classified. In [2], a few results on equitable partitions and regular sets of Cayley graphs involving irreducible characters of the underlying groups are ...
Derving Bipartite graphs from hypergraphs Proposition 1 Any regular uniform hypergraph HGk,d can be represented usefully by a bipartite graph BGn,m: the vertices V and the edges E of the hypergraph are the partitions of BG, and (v i , e j ) are connected with an edge if and only if ...
A natural generalization of a regular (or equitable) partition of a graph, which makes sense also for non-regular graphs, is the so-called weight-regular partition, which gives to each vertex u ∈ V a weight that equals the corresponding entry ν u of the Perron eigenvector ν . This ...
distance regular graphsregular partitiongeneralized polygonsIn this paper we define a regular m-partition of a distance regular graph as a partition of the vertex set into m classes, such that the number of vertices of a given class adjacent to a fixed vertex of another class (but possibly ...
we deduce fast mixing of the Swendsen–Wang dynamics for the Potts model on random-regular graphs for every, in the tree uniqueness region. Our proof relies on a sharp bound on the “shattering time”, i.e., the number of steps required to break up any configuration intosized clusters....